⚡ 快速排序視覺化

function quickSort(arr, left, right):
  if left >= right: return
  pivot = arr[(left + right) / 2]
  i = left, j = right
  while i <= j:
    while arr[i] < pivot: i++
    while arr[j] > pivot: j--
    if i <= j:
      swap(arr[i], arr[j])
      i++, j--
  quickSort(arr, left, j)
  quickSort(arr, i, right)