Alternative HASKELL QUICKSORT
Write quicksort in Haskell by writing quickSort :: Ord a =>[a] -> [a] that sorts a list, and Partition sort (helpfer funcfor Doublelit) You will also need a Partition helper function thatpartitions the input list according to the pivot (firstelement).
-Selects a pivot (first element)
-Has a partition helper function
-Sorts the list using quicksort
Reasembles resulting list by appending sorted list of lesservalues with the pivot and the sorted list of greater values.
This Implementation must be as basic aspossible (~11 lines of code), no Data.List functions areallowed, and we CANNOT use the followingimplementation.
qsort [] =[]
qsort (x:xs) = qsort smaller ++ [x]
PayPal Gateway not configured
PayPal Gateway not configured