Finding the k^th Smallest Value of an Array

High level pseudocode solution:

Your task is to implement and test the algorithm

Returns the kth smallest value in anArray[first..last] kSmallCk: integer anArray: ArrayType first integer, last integer) ValueType Choose a pivot value p from an Array[first. .last] Partition the values of anArray[first. .last] about p if (k pivot Index first 1) return k Small Ck, anArray, first, pivotIndex 1) else if (k pivot Index first 1) return p else return k Small (k (pivot Index first 10, anArray, pivot Index 1, last