Quick Sort using C++programming language.
Srivenurajulu G
Mar 01, 2021
QuickSort follows the divide and conquer algorithm technique. It picks an element as a pivot and then it splits the given array around the picked pivot. element and then it is sorted. Using C++.
Definition:
QuickSort is a Divide and Conquer algorithm. It picks an element as a pivot and then it splits the given array around the picked pivot. element and then it is sorted.
Algorithm:
- Start
- Choose the highest index value a pivot.
- Take to variables to point left and right of the list excluding the pivot element.
- Left points to the low index and Right points to the high index
- Value at the left is lesser than pivot move right.
- Value at the right is greater than pivot move left
- If both step 5 and step 6 do not match swap left and right.
- If left is greater than equal to right the point where they met the new pivot.
- Stop.
For Example, if you give an array of size 4, elements are 9,2,8,0
Sorted Array is 0,2,8,9
Project Files
/
Loading...
| .. | ||
| This directory is empty. | ||
