What are the formulas for these Worst Case Time Complexities?
The worst case time complexity for Bubble Sort is : (n(n-1))/2 , (or at least I Think)
What is the worst case time complexity for:
Selection Sort
Insertion Sort (Is this the same as BubbleSort?)
Binary Search
Linear Search
And if I am wrong on Bubble Sorts Worst case, then what would it be?