I am having some trouble finding this on the internet and I am hearing different things. What are the Worst Best and Average Cases for: Selection Sort (W: O(n^2), B: O(n^2), A:O(n^2)) Insertion Sort (W: O(n^2), B: O(n)/O(1), A:O(n^2)) Merge Sort (W: O(n * Log n), B:O(n * Log n)/O(n), A:O(n * log n)) Quick Sort (W: O(n^2), B: O(n * Log n)/O(n), A:O(n * Log n)) Are these right? How come some have worst and best cases as the same? How come some have two best case scenarios? What about efficiency what is that? Like what is the efficiency for quick sort? Thanks for your time
depend on the data... an algorithm could be as the best, could be the worst. read here :