Ask Your Question

Revision history [back]

click to hide/show revision 1
initial version

What evidence is there to support the claim that the optimal scenario complexity of quicksort is O(n log n)?