Sorting by Insertion-sort and returning the k’th element in the list, (ii) Sorting by Merge-sort and returning the k’th element in the list, (iii) Not sorting the list, but applying quick select algorithm, which is based on array partitioning, as described in the class. While partitioning, choose the pivot element as the first element in an array. (iv) Applying quick select algorithm, but this time using median-of-three pivot selection 1 ,
Sorting by Insertion-sort and returning the k’th element in the list, (ii) Sorting by Merge-sort and returning the k’th element in the list, (iii) Not sorting the list, but applying quick select algorithm, which is based on array partitioning, as described in the class. While partitioning, choose the pivot element as the first element in an array. (iv) Applying quick select algorithm, but this time using median-of-three pivot selection 1 ,