It is quite easy to visualize this statement since the median which we report will be (k/2)th element and if we take k/2 elements from the left quarter.
cormen solutions
2 Articles
2
Activity Selection Problem – Greedy Algorithm – Greedy is an algorithmic paradigm that builds up a solution piece by piece, always choosing the next piece that offers the most obvious and immediate benefit.