title: Ceiling In A Sorted Array 1
signature: ceilingInASortedArray1(arr, low, high, x) {
source_py: def ceiling_in_a_sorted_array_1(arr, low, high, x):
      if (x <= arr[low]):
          return low
      if (x > arr[high]):
          return (- 1)
      mid = ((low + high) / 2)
      if (arr[mid] == x):
          return mid
      elif (arr[mid] < x):
          if (((mid + 1) <= high) and (x <= arr[(mid + 1)])):
              return (mid + 1)
          else:
              return ceiling_in_a_sorted_array_1(arr, (mid + 1), high, x)
      elif (((mid - 1) >= low) and (x > arr[(mid - 1)])):
          return mid
      else:
          return ceiling_in_a_sorted_array_1(arr, low, (mid - 1), x)
source_cpp: int ceiling_in_a_sorted_array_1(vector<int> arr, int low, int high, int x) {
    int mid;
    if ( x <= arr [ low ] ) return low;
    if ( x > arr [ high ] ) return - 1;
    mid = ( low + high ) / 2;
    if ( arr [ mid ] == x ) return mid;
    else if ( arr [ mid ] < x ) {
      if ( mid + 1 <= high && x <= arr [ mid + 1 ] ) return mid + 1;
      else return ceiling_in_a_sorted_array_1 ( arr, mid + 1, high, x );
    }
    else {
      if ( mid - 1 >= low && x > arr [ mid - 1 ] ) return mid;
      else return ceiling_in_a_sorted_array_1 ( arr, low, mid - 1, x );
    }
  }