Quirinus

recursiveBinarySearch function

Oct 12th, 2018
128
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 0.38 KB | None | 0 0
  1. int rBinarySearch(int sortedArray[], int first, int last, int key)
  2. {
  3.     if (first <= last)
  4.     {
  5.         int mid = (first + last) / 2;
  6.         if (key == sortedArray[mid])
  7.         {
  8.             return mid;
  9.         }
  10.         else if (key < sortedArray[mid])
  11.         {
  12.             return rBinarySearch(sortedArray, first, mid - 1, key);
  13.         }
  14.         else
  15.         {
  16.             return rBinarySearch(sortedArray, mid + 1, last, key);
  17.         }
  18.     }
  19.     return -1;
  20. }
Advertisement
Add Comment
Please, Sign In to add comment