QuickSort

def quickSort(left, right):    global seq    if left >= right:        return    tmp = seq[left]    low = left    hight = right    while low != hight:        while (seq[hight] >= tmp) and (hight > low):            hight -= 1        seq[low] = seq[hight]        while (seq[low] <= tmp) and (low < hight):            low += 1        seq[hight] = seq[low]    seq[low] = tmp    quickSort(left, low - 1)    quickSort(low + 1, right)