待判断的Python代码功能为对一维list（形如：[32,12,32,13,42,1]，而非[(1,3),(3,1),(321,321),(32,13)]）进行快速排序，代码如下：

def qSort(arr):
    if len(arr) <= 1:
        return arr
    pivot = arr[len(arr) // 2]
    left, middle, right = [], [], []
    for num in arr:
         if num < pivot:
             left.append(num)
         elif num > pivot:
             right.append(num)
         else:
             middle.append(num)
    return qSort(left) + middle + qSort(right)