Pythonでベーシックなクイックソート( ･ω･)ﾉ

quickSort.py

def quickSort(data, left, right):
  index = partition(data, left, right)
  if left < index - 1:
    quickSort(data, left, index - 1)
  if index < right:
    quickSort(data, index, right)

def partition(data, left, right):
  pivot = data[(left + right) / 2]
  while left < right:
    while data[left] < pivot:
      left += 1
    while data[right] > pivot:
      right -= 1
    if left < right and data[left] > data[right]:
      tmp = data[left]
      data[left] = data[right]
      data[right] = tmp
    left += 1
    right -= 1
  return left