A simple function to find median of arr[]
| 27 | |
| 28 | // A simple function to find median of arr[] |
| 29 | int findMedian(int arr[], int n) { |
| 30 | sort(arr, arr + n); |
| 31 | return arr[n / 2]; |
| 32 | } |
| 33 | |
| 34 | // Returns kth smallest element in arr[] in worst case linear time |
| 35 | int kthSmallest(int arr[], int l, int r, int k) { |