Prove by induction that a selection algorithm with sizes of group g (where g >= 6) operates in O(n) time. U may assume g is odd.

Selection algorithm referred to above is the algorithm that uses a quick sort variation to k-th smallest element in a data set.