You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
There's an incorrect comment on line 14 says "Average case = O(n) Worst case = O(n^2) Best case = O(n_log n)", which contradicts commtent on line 6 and 7 that says " *Quicksort is a sorting algorithm which, on average, makes O(n_log n) comparisons to sort n items. In the worst case, it makes O(n^2) comparisons", I think the latter is correct.