What are some algorithms which we use daily that have [math]O(n), O(n^2),[/math] and [math]O(\log n)[/math] complexities?
How is the average case running time of the quick sort algorithm closer to the best case : O(n log n) than the worst case : O(n^2)?