title: Recursive C Program Linearly Search Element Given Array
signature: recursiveCProgramLinearlySearchElementGivenArray(arr, l, r, x) {
test_code: import 'dart:convert';
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  bool validateSolution(int actual, int expected){
      return actual.toString() == expected.toString();
  }
  
  String driver(arr, l, r, x, int expected){
      try
      {
          if (validateSolution(PLACEHOLDER_FN_NAME(arr, l, r, x), expected)){
              return "PASSED";
          }
          return "FAILED";
      }catch(exception_object){
          return exception_object.runtimeType.toString();
      }
  }
  
  int main() {
  
      print("TEST-0...${driver(
          [10, 74, 5], 0, 2, 1, 
          -1)
      }");
  
      print("TEST-1...${driver(
          [-90, 72, 36, 96, 42, 0, -66, 5], 0, 7, 96, 
          3)
      }");
  
      print("TEST-2...${driver(
          [0, 5], 0, 1, -1, 
          -1)
      }");
  
      print("TEST-3...${driver(
          [99, 70, 67, 5], 0, 3, 3, 
          -1)
      }");
  
      print("TEST-4...${driver(
          [-98, -98, -26, -26, -24, -18, -16, 80, 5], 0, 8, 80, 
          7)
      }");
  
      print("TEST-5...${driver(
          [1, 1, 1, 1, 0, 1, 5], 0, 6, 1, 
          0)
      }");
  
      print("TEST-6...${driver(
          [1, 5, 12, 12, 17, 17, 12, 95, 96, 98, 5], 0, 0, 12, 
          -1)
      }");
  
      print("TEST-7...${driver(
          [50, -70, -30, -54, 6, -10, 70, 84, 5], 0, 8, 27, 
          -1)
      }");
  
      print("TEST-8...${driver(
          [0, 1, 5], 0, 2, 14, 
          -1)
      }");
  
      print("TEST-9...${driver(
          [59, 21, 28, 3, 14, 5], 0, 5, 28, 
          2)
      }");
  
      return 0;
  }
source_py: def recursive_c_program_linearly_search_element_given_array(arr, l, r, x):
      if (r < l):
          return (- 1)
      if (arr[l] == x):
          return l
      if (arr[r] == x):
          return r
      return recursive_c_program_linearly_search_element_given_array(arr, (l + 1), (r - 1), x)
source_cpp: int recursive_c_program_linearly_search_element_given_array(vector<int> arr, int l, int r, int x) {
    if ( r < l ) return - 1;
    if ( arr [ l ] == x ) return l;
    if ( arr [ r ] == x ) return r;
    return recursive_c_program_linearly_search_element_given_array ( arr, l + 1, r - 1, x );
  }