Efficient sorting algorithm: quick sort

Quick sort is an efficient sorting algorithm. Its core idea is to divide the array into smaller parts through a divide-and-conquer strategy and sort them according to a certain benchmark value. This article will introduce in detail how to use Python to implement the quick sort algorithm.

The code to implement quick sort is as follows:

def quick_sort(arr):
    if len(arr) <= 1:
        return arr
    pivot = arr[len(arr) //