haskellhaxx

quicksort :: [Int] -> [Int]
quicksort [] = []
quicksort [x] = [x]
quicksort xs = 
  quicksort(less) ++ [pivot] ++ quicksort(greater)
  where
    m = length xs `div` 2
    pivot = xs!!m
    less = [ xs!!i | i <- [0..(length xs)-1], xs!!i <= pivot && i /= m ]
    greater = [ xs!!i | i <- [0..(length xs)-1], xs!!i > pivot && i /= m ]