In the Algorithm SELECT in chapter 9 (Selection in worst-case linear time ), the elements were...

 

Transcribed Image Text:

In the Algorithm SELECT in chapter 9 (Selection in worst-case linear time ), the elements were divided into groups of 5, the algorithm works in linear time. Show whether the algorithm will work in linear time if elements are divided into groups of 7? (explain your answer) and also when divided into group of 3? (explain your answer) In the Algorithm SELECT in chapter 9 (Selection in worst-case linear time ), the elements were divided into groups of 5, the algorithm works in linear time. Show whether the algorithm will work in linear time if elements are divided into groups of 7? (explain your answer) and also when divided into group of 3? (explain your answer) In the Algorithm SELECT in chapter 9 (Selection in worst-case linear time ), the elements were divided into groups of 5, the algorithm works in linear time. Show whether the algorithm will work in linear time if elements are divided into groups of 7? (explain your answer) and also when divided into group of 3? (explain your answer) In the Algorithm SELECT in chapter 9 (Selection in worst-case linear time ), the elements were divided into groups of 5, the algorithm works in linear time. Show whether the algorithm will work in linear time if elements are divided into groups of 7? (explain your answer) and also when divided into group of 3? (explain your answer)