Question: In class, we have studied the linear time algorithm for selection. In that algorithm, we have used groups of size 5. Suppose we are using
In class, we have studied the linear time algorithm for selection. In that algorithm, we have used groups of size 5. Suppose we are using groups of size 13.
derive the corresponding recurrence formula.
What is the corresponding time complexity of the algorithm?
I found the reccurance relation to be T(n)=O(n)+T(n/13)+T(19n/26), but I am having trouble finding the time complexity. Also I really want to learn this, so a detailed response would be nice. I believe it is O(n) but I am not sure as to why.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
