Quick sort is a faster way to sort a given array by recursion

The algorithm goes like this:

it first takes some index element and seperates all elements lesser than this with larger numbers then places this element in right place and does the same thing with all other