Quicksort or partition-exchange sort is aptly named because, when
properly implemented, it is the fastest known general-purpose in-memory
sorting algorithm in the average case. Quick sort is a sorting algorithm
developed by Tony Hoare that, on average, makes O(n log n) comparisons
to sort n items.

Click here for Quick Sort algorithm with easy simple examples in C & Java.

## Comments

## Post a Comment