Skip to content
← Back to Community
Quicksort Algorithm
Profile icon
sandeepnyoupane

Quick sort is a divide and conquer algorithm it works by selecting a pivot element from the array and partitioning the other elements into tow subarray where they are less then or greater then the pivot. Then the subarray are sorted recursively. The algorithm takes the time complexity of O(n log n) on an average case.

Voters
Profile icon
MenachemWeiss
Profile icon
sandeepnyoupane