Quick Sort is the speedster of sorting algorithms. It picks a pivot element and then arranges the rest of the elements into two groups: those less than the pivot and those greater. By recursively sorting these groups, Quick Sort efficiently sorts even the largest datasets. It is perfect blend of strategy and speed, making it one of the most popular sorting techniques.

    function quickSort(start, end):

        if start < end:

            pivot = partition(start, end)

            quickSort(start, pivot - 1)

            quickSort(pivot + 1, end)