🧠 大白算法在线测试

// 大白算法 · 快速排序实现 (Python)
def quick_sort(arr):
  if len(arr) <= 1: return arr
  pivot = arr[len(arr)//2]
  left = [x for x in arr if x < pivot]
  middle = [x for x in arr if x == pivot]
  right = [x for x in arr if x > pivot]
  return quick_sort(left) + middle + quick_sort(right)