`NS_QuickSort` is known to have a worst case quadratic performance and that it can lead to over-recursion and subsequent stack overflows. `std::sort` uses a introsort algorithm these days, which avoids these caveats. This increases also the type safety, as `NS_QuickSort` uses `void*` and just memmoves the elements regardless their eventual copy assignment operator.
Bug 1839051 Comment 0 Edit History
Note: The actual edited comment in the bug view page will always show the original commenter’s name and original timestamp.
`NS_QuickSort` is known to have a worst case quadratic performance and that it can lead to over-recursion and subsequent stack overflows. `std::sort` uses an introsort algorithm these days, which avoids these caveats. This increases also the type safety, as `NS_QuickSort` uses `void*` and just memmoves the elements regardless their eventual copy assignment operator.
`NS_QuickSort` is known to have a worst case quadratic performance and that it can lead to over-recursion and subsequent stack overflows. `std::sort` uses an introsort algorithm these days, which avoids these caveats. This increases also the type safety, as `NS_QuickSort` uses `void*` and just memmoves the elements regardless their eventual move or copy assignment operators.