Problem Description( Refer to Exercise 6 on Page 116)
Write a quick sort function of type int list -> int list. Here is a review for quick sort
algorithm. First pick an element and call it pivot. (The head of the list is an easy
choice for the pivot.) Partition the rest of the list into two sublists, one with all the
elements less than the pivot and another one with all the elements not less than the
pivot. Recursively sort the sublists. Combine two sublists and pivot into final sorted
The solution must follow the style of function merge sort on page 114. The help
functions must be made inside let.
Please see the screen shot below to see the sample run
File to turn in:
Save your function in file names YourNameProjTwo.sml and submit it via
Will be announced on blackboard.