Please, avoid sorting, so you can do in linear time what otherwise requires O(n log n).

Implement the quickselect algorithm on arrays. You write one function

int quickselect(int *A, int k, int n);

which returns the k-th smallest entry of an array A of length n. The programming

language is C or C++; test your code before submission using the gcc or g++ compiler.

Please remove all dead code; try to program as clearly as possible, since I try to read

it. Your function for this should be less than fifty lines of code long. You can use the

quicksort code