The code contains a lot of comments, you can refer to it, no more

Writing a code in the next day, a quick sort algorithm is simple and easy to understand, but the time complexity is high.

# Use the list of rapid sorting to the following list
alist = [30, 24, 5, 58, 18, 36, 12, 42, 39]


def sort_value(alist, start=0, end=len(alist) - 1):
    '''
         : Param alist: A list of sorting
         : Param Start: The default start position is the subscript of the first element of the list
         : param end: The default end position is the subscript of the last element of the list
    :return:
    '''

    # If the list has only one element, or
    if start >= end:
        return

    # Define a pointer MID and initially pointing the pointer to the first element of the list.
    mid = alist[start]
    # Define a pointer PRE pointing list START location
    pre = start
    # Defines a pointer next point to the list of Len (ALIST) -1 positions
    next = end

    # If the pre pointer is before, the Next pointer is behind, enter the loop
    while pre < next:
        # If the list of NEXT points to the element greater than the element pointing to the MID, then the element pointed to by NEXT is not movable.
        while alist[next] > mid and pre < next:
            # And move the Next pointer forward one
            next -= 1
        # If you enter the above loop, then the position pointed by the pointer before NEXT-1 does not move, and put the position of the element points pointed to the pointer to the pre-pointer to the PRE pointer.
        # If you do not enter the above loop, you assign the element points to the element pointing to the pre-pointer.
        alist[pre] = alist[next]
        # If the element pointed to by the list is less than or equal to the element pointed to by the MID, then the element pointed to by the pre-pointed
        while alist[pre] <= mid and pre < next:
            # And move the Pre pointer backward
            pre += 1
        # If you enter the above loop, then the position pointed by the pointer before pre + 1 does not move, and put the position of the element pointing to the pointer to the NEXT pointer to the position of the pointer.
        # If you do not enter the above loop, you assign the element points to the Ele pointer to the PRE pointer.
        alist[next] = alist[pre]
    #                            ,  ,  ,  ,  ,  ,
    #                
    alist[pre] = mid

    #     Tune the above function, sort the elements of the left and right sides
    sort_value(alist, start, next - 1)
    sort_value(alist, pre + 1, end)


sort_value(alist)
print(alist)