A
Ark
Is there a standard STL sorting algorithm that guarantees me O(n*log n) in
the worst case?
My understanding is that sort() is based on the quick sort algorithm which
is O(n^2) in the worst case (and I'm only interested in the worst case, not
average) ... maybe something similar to a merge sort ?
thanks in advance
the worst case?
My understanding is that sort() is based on the quick sort algorithm which
is O(n^2) in the worst case (and I'm only interested in the worst case, not
average) ... maybe something similar to a merge sort ?
thanks in advance