Quicksort Algorithm
The quicksort is an example of a divide and conquers algorithm in that it divides the
sorting problem into smaller problems by dividing the list of items to be sorted into
smaller subsets. The pivot is the mechanism that is used to segment the list.
Quick Sort is a recursive algorithm, when we think about quick the word pivot (central point)
should always come to mind. Quicksort works with the idea that an element should be sorted if
all elements to the left of that element is smaller than the element and all element to the right
of that element should be greater than that element.
