| 3 | using namespace std; |
| 4 | |
| 5 | int pivotIndex (int arr[], int lo, int hi) { |
| 6 | // base case |
| 7 | if (lo == hi) { |
| 8 | return lo; |
| 9 | } |
| 10 | int mid = lo + (hi - lo)/2; |
| 11 | // recursive relation |
| 12 | if (arr[mid] >= arr[0]) { // LINE-1 |
| 13 | return pivotIndex(arr, mid+1, hi); |
| 14 | } |
| 15 | else { // LINE-2 |
| 16 | return pivotIndex(arr, lo, mid); |
| 17 | } |
| 18 | } |
| 19 | |
| 20 | int main() { |
| 21 | int array[5] = {8,10,17,1,3}; |