Quick Sort

 Quick Sort

Quick sort is a divide-and-conquer algorithm that works by selecting a 'pivot' element from the array and partitioning the other elements into two sub-arrays, according to whether they are less than or greater than the pivot. The sub-arrays are then sorted recursively.

python

# Quick sort function

def quick_sort(arr):

    if len(arr) <= 1:

        return arr

    pivot = arr[0]

    left = [x for x in arr[1:] if x < pivot]

    right = [x for x in arr[1:] if x >= pivot]

    return quick_sort(left) + [pivot] + quick_sort(right)