MIT Algorithms (3)
Sorting
-How fast can we sort
-It depends on model:)
the model is of what you can do with the elements
e.g
Quicksort θ(nlgn)
Heapsort θ(nlgn)
merge sort θ(nlgn)
insertion sort θ(n2)
so, can we do better than θ(nlgn)?
Continue reading MIT Algorithms (3)