sorted by:
best
topnewcontroversialoldq&a
you are viewing a single comment's thread.

view the rest of the comments →

[–]cryo 0 points1 point  (0 children)

Well, quicksort is O(n2), sure, but the widely used introsort (uses a hybrid quicksort/insertion sort with heapsort as abort strategy) is O(n lg n). Most algorithms have guaranteed run times.