Quick Sort Algorithm easy to understand the process of quick sort. How it works. No coding required.
Algorithm of Quick Sort:
Quick sort is a highly efficient sorting algorithm and is based on partitioning of array of data into smaller arrays. A large array is partitioned into two arrays one of which holds values smaller than the specified value, say pivot, based on which the partition is made and another array holds values greater than the pivot value.
Step 1 − Choose the highest index value has pivot
Step 2 − Take two variables to point left and right of the list excluding pivot
Step 3 − left points to the low index
Step 4 − right points to the high
Step 5 − while value at left is less than pivot move right
Step 6 − while value at right is greater than pivot move left
Step 7 − if both step 5 and step 6 does not match swap left and right
Step 8 − if left ≥ right, the point where they met is new pivot
Please like, share and subscribe.
Contact me via:
Email: info.kode4u@gmail.com
Website: [ Ссылка ]
![](https://s2.save4k.ru/pic/GdZzKgQm8FE/maxresdefault.jpg)