title: Recursive C Program Linearly Search Element Given Array
signature: function recursiveCProgramLinearlySearchElementGivenArray($arr, $l, $r, $x) {
test_code: <?php
  
  
  // SOLUTION CODE 
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  function validateSolution($actual, $expected){
      return serialize($actual) == serialize($expected);
  }
  
  function driver($arr, $l, $r, $x, $expected){
      try{
        if (validateSolution(PLACEHOLDER_FN_NAME($arr, $l, $r, $x), $expected)){
          return "PASSED";
        }
        return "FAILED";
      }
      catch (Exception $exception_obj) {
        return get_class($exception_obj);
      }
  }
  
  function main(){
      printf("TEST-0...%s\n",driver(
        array(10, 74, 5), 0, 2, 1, 
        -1));
      
      printf("TEST-1...%s\n",driver(
        array(-90, 72, 36, 96, 42, 0, -66, 5), 0, 7, 96, 
        3));
      
      printf("TEST-2...%s\n",driver(
        array(0, 5), 0, 1, -1, 
        -1));
      
      printf("TEST-3...%s\n",driver(
        array(99, 70, 67, 5), 0, 3, 3, 
        -1));
      
      printf("TEST-4...%s\n",driver(
        array(-98, -98, -26, -26, -24, -18, -16, 80, 5), 0, 8, 80, 
        7));
      
      printf("TEST-5...%s\n",driver(
        array(1, 1, 1, 1, 0, 1, 5), 0, 6, 1, 
        0));
      
      printf("TEST-6...%s\n",driver(
        array(1, 5, 12, 12, 17, 17, 12, 95, 96, 98, 5), 0, 0, 12, 
        -1));
      
      printf("TEST-7...%s\n",driver(
        array(50, -70, -30, -54, 6, -10, 70, 84, 5), 0, 8, 27, 
        -1));
      
      printf("TEST-8...%s\n",driver(
        array(0, 1, 5), 0, 2, 14, 
        -1));
      
      printf("TEST-9...%s\n",driver(
        array(59, 21, 28, 3, 14, 5), 0, 5, 28, 
        2));
      
  }
  
  main();
  ?>
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 );
  }