I read order statistics from the book The Design and Analysis of Computer Algorithms", by Aho, Hopcroft, Ullman, Addison-Wesley
As per the algorithm the recurrence relation given
T(n)<= cn for n<=49 .....1
T(n)<= T(n/5) + T(3n/4) + cn for n>=50 .....2
How can I prove it by induction T(n)<= 20cn?
I have two more questions
For the 1st equation why they define n<=49 and for the 2nd equation n>=50