Question: You are given an unsorted array A of size n. Your task is to output k elements of equally-spaced ranks (n/k, 2n/k, ellipsis, (k -

You are given an unsorted array A of size n. Your task is to output k elements of equally-spaced ranks (n/k, 2n/k, ellipsis, (k - 1)n/k, n.) How fast can you solve it naively using the linear-time median-finding algorithm as ablack box? Can you do better than that? You are given an unsorted array A of size n. Your task is to output k elements of equally-spaced ranks (n/k, 2n/k, ellipsis, (k - 1)n/k, n.) How fast can you solve it naively using the linear-time median-finding algorithm as ablack box? Can you do better than that
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
