What are the steps in quick sort?
4 years ago
Data Structure and Algorithm
The steps are:
- Pick an element, called a pivot, from the
- Reorder the list so that all elements with values less than the pivot come before the pivot, while all elements with values greater than the pivot come after it (equal values can go either way). After this partitioning, the pivot is in its final This is called the partition operation.
- Recursively apply the above steps to the sub-list of elements with smaller values and separately to the sub-list of elements with greater
Sanisha Maharjan
Jan 23, 2022