About this document
Quick Sort Analysis and Implementation by SRI HARSHA SARAGADAM is a document available to read on EtoBox.
Quicksort uses divide and conquer like merge sort. It avoids the merge step by carefully partitioning the list so that elements smaller than the pivot are in one partition and larger elements in the other. This allows an in-place sort. The average-case time complexity is O(n log n) but the worst-case is O(n^2). Choosing pivots randomly helps avoid worst-case inputs. Quicksort is often used in practice due to its speed, despite the theoretical worst-case.
- Author
- SRI HARSHA SARAGADAM
- Language
- EN