fun quicksort nil : int list = nil
  | quicksort (x::xs) =
    let 
        val part = List.partition (fn y => y<x) xs
	val left = #1 part
        val right = #2 part
    in
	quicksort left @ [x] @ quicksort right
    end