3 ms·
Mergesort worst case is O(nlog(n)). If there's a downside to it, it's that you need to allocate memory.
by karpierz 5y ago
Mergesort worst case is O(nlog(n)). If there's a downside to it, it's that you need to allocate memory.
- touisteur 5y agoWhich is where you get problematic tail latencies. Or your data fits on the stack.