c programming seashell

no recursion and find the k-th largest number without sorting/mutating the array.

Write a function int kth_1argest (int at, int len, int k) which returns the k-th largest number in an int array of length len with distinct elements (i.e., no duplicates). For example if a is (4,2,6, 12, 8, 7, 14] and k=3, the 3rd largest number in this array is 8. If the k'th largest number does not exist, the function must return INT-MIN. You must find the k-th largest number without sorting/mutating the array