title: Recursive C Program Linearly Search Element Given Array
signature: function recursiveCProgramLinearlySearchElementGivenArray(arr: Array<number>, l: number, r: number, x: number): number {
test_code: 
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  function convertToString(value: any): string{
      return JSON.stringify(value, function (key, val) {
          if (val instanceof Set) {
              return Array.from(val);
          } return val;});
  }
  
  function validateSolution(actual: number, expected: number): boolean {
      return convertToString(actual) === convertToString(expected);
  }
  
  function driver(arr: Array<number>, l: number, r: number, x: number, expected:number): string {
      try{
          if (validateSolution(PLACEHOLDER_FN_NAME(arr, l, r, x),expected)){
              return "PASSED";
          }
          return "FAILED";
      } catch (error) {
        return error.name;
      }
      
  }
      
  function main(){
    let result = '';
    result = driver([10, 74, 5], 0, 2, 1, -1);
    console.log(`TEST-0...${result}`);
  
    result = driver([-90, 72, 36, 96, 42, 0, -66, 5], 0, 7, 96, 3);
    console.log(`TEST-1...${result}`);
  
    result = driver([0, 5], 0, 1, -1, -1);
    console.log(`TEST-2...${result}`);
  
    result = driver([99, 70, 67, 5], 0, 3, 3, -1);
    console.log(`TEST-3...${result}`);
  
    result = driver([-98, -98, -26, -26, -24, -18, -16, 80, 5], 0, 8, 80, 7);
    console.log(`TEST-4...${result}`);
  
    result = driver([1, 1, 1, 1, 0, 1, 5], 0, 6, 1, 0);
    console.log(`TEST-5...${result}`);
  
    result = driver([1, 5, 12, 12, 17, 17, 12, 95, 96, 98, 5], 0, 0, 12, -1);
    console.log(`TEST-6...${result}`);
  
    result = driver([50, -70, -30, -54, 6, -10, 70, 84, 5], 0, 8, 27, -1);
    console.log(`TEST-7...${result}`);
  
    result = driver([0, 1, 5], 0, 2, 14, -1);
    console.log(`TEST-8...${result}`);
  
    result = driver([59, 21, 28, 3, 14, 5], 0, 5, 28, 2);
    console.log(`TEST-9...${result}`);
  
  };
  
  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 );
  }