0% found this document useful (0 votes)
2 views

Quick Sort (1)

Uploaded by

Prasanta Agasti
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
2 views

Quick Sort (1)

Uploaded by

Prasanta Agasti
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Quick Sort

Code
Quick Sort
Time Complexity
Worst : O(n^2)
Average : O(nlogn)

Important

Worst case occurs


when pivot is always
the smallest or the
largest element.

You might also like