Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- int rBinarySearch(int sortedArray[], int first, int last, int key)
- {
- if (first <= last)
- {
- int mid = (first + last) / 2;
- if (key == sortedArray[mid])
- {
- return mid;
- }
- else if (key < sortedArray[mid])
- {
- return rBinarySearch(sortedArray, first, mid - 1, key);
- }
- else
- {
- return rBinarySearch(sortedArray, mid + 1, last, key);
- }
- }
- return -1;
- }
Advertisement
Add Comment
Please, Sign In to add comment