quicksort-python

def quicksort(arr):
  if arr == []:
    return []
  if len(arr) == 1:
    return arr
  m = len(arr) / 2
  pivot = arr[m]
  less = [ arr[x] for x in range(0, len(arr)) if arr[x] <= pivot and x != m ]
  greater = [ arr[x] for x in range(0, len(arr)) if arr[x] > pivot and x != m ]
  return quicksort(less) + [pivot] + quicksort(greater)