Algorithm Design: Efficient O(n) algorithm to get the ith to jth largest elements in an array
I could do QuickSelect (j - i) times to get all the elements


Overkill. Two calls to QuickSelect and one linear pass are sufficient.