quicksort.py

import random

def quicksort(data):
  '''
  quicksort: sort a list via quicksort (recurrsive version)
  args:
    data: the list to be sort
  return：
    the sorted list (allocated)
  '''
  if len(data) in [0, 1]: return data
  pivot, remain = data[0], data[1:]
  left = [i for i in remain if i < pivot]
  right = [i for i in remain if i >= pivot]
  return quicksort(left) + [pivot] + quicksort(right)

def test():
  x = list(range(0x20))
  random.shuffle(x)
  e = list(range(0x20))
  assert quicksort(x) == e

def main():
  test()

if __name__ == "__main__":
  test()