Select algorithm:

mm is median of medians

Assume that the SELECT algorithm is modified such that the array is divided into groups of size 3, instead of groups of size 5 Investigate whether the (n) time complexity bound can be achieved in this case, proving your answer Assume that the SELECT algorithm is modified such that the array is divided into groups of size 3, instead of groups of size 5 Investigate whether the (n) time complexity bound can be achieved in this case, proving your