Re:WikiSort – Fast, stable, O(1) space merge sort algorithm
by klmr on Saturday March 15, 2014 @01:25PM
(#7405272)
Many/most widely used “quicksort” implementations are actually introsort (in particular, `std::sort` is), and thus O(nlogn) worst case.
[ Parent
| on HN ]
There are no comments on this comment yet.