Given a list of 'n' numbers, this program will find the Kth smallest element in the list.  The first algorithm sorts the list and then returns the Kth smallest element.  The second algorithm applies the procedure Partituion used in Quick Sort, which partitions an array so that all elements smaller than some pivot item come before it in the array and all elements larger than the pivot item come after it.  The third algorithm applies the Partition algorithm but using the "mm rule".