Median Finding and Quick Sort. Suvarna Angal. Project Requirements. Implement the median-finding algorithms – Random and Linear Median Finding Algorithms. The user is able to select the “k”, i.e., the rank of the number desired as output (k = n/2 is the median).
else if |S| - |S2| >= k return m;
else return Qsel(S2,k-|S|+|S2|);