Alternative HASKELL QUICKSORT

Write quicksort in Haskell by writing quickSort :: Ord a => [a] -> [a] that sorts a list, and Partition sort (helpfer func for Doublelit) You will also need a Partition helper function that partitions the input list according to the pivot (first element).

-Selects a pivot (first element)

-Has a partition helper function

-Sorts the list using quicksort

Reasembles resulting list by appending sorted list of lesser values with the pivot and the sorted list of greater values.

This Implementation must be as basic as possible (~11 lines of code), no Data.List functions are allowed, and we CANNOT use the following implementation.

qsort [] = []

qsort (x:xs) = qsort smaller ++ [x] ++ qsort larger

where

smaller = [a | a <- xs, a <= x]

larger = [b | b <- xs, b > x]