Quick Sort as the name states it is one of the quickest conventional sorting algorithm. It follows divide and conquer algorithmic technique for sorting the list of elements. Instead of dividing the element into equal parts and sub dividing them, it has a pointer called as pivot and divides on pivot basics. The values lesser than pivot are to the left of it and the values which is greater and equal are to the right of it.
Feel free to contact me through the following mail id
thezensloth@gmail.com
Learning made easy.
Never stop learning.
