title: Recursive C Program Linearly Search Element Given Array
signature: pub fn recursive_c_program_linearly_search_element_given_array(arr: Vec<i32>, l: i32, r: i32, x: i32) -> i32 {
test_code: use std::collections::HashMap;
  use std::collections::HashSet;
  use std::cmp::*;
  use std::collections::*;
  use std::fmt::*; 
  
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  pub fn validate_solution(actual: i32, expected: i32)->bool{
  return actual==expected
  }
  pub fn driver(arr: Vec<i32>, l: i32, r: i32, x: i32, expected: i32)->String{
      if validate_solution(PLACEHOLDER_FN_NAME(arr, l, r, x), expected) {
        return "PASSED".to_string();
      };
      return "FAILED".to_string();
  
  }
  
  fn main() {
      println!("TEST-0...{}", driver(
        Vec::from([10, 74, 5]), 0, 2, 1, 
        -1
      ));
      
      println!("TEST-1...{}", driver(
        Vec::from([-90, 72, 36, 96, 42, 0, -66, 5]), 0, 7, 96, 
        3
      ));
      
      println!("TEST-2...{}", driver(
        Vec::from([0, 5]), 0, 1, -1, 
        -1
      ));
      
      println!("TEST-3...{}", driver(
        Vec::from([99, 70, 67, 5]), 0, 3, 3, 
        -1
      ));
      
      println!("TEST-4...{}", driver(
        Vec::from([-98, -98, -26, -26, -24, -18, -16, 80, 5]), 0, 8, 80, 
        7
      ));
      
      println!("TEST-5...{}", driver(
        Vec::from([1, 1, 1, 1, 0, 1, 5]), 0, 6, 1, 
        0
      ));
      
      println!("TEST-6...{}", driver(
        Vec::from([1, 5, 12, 12, 17, 17, 12, 95, 96, 98, 5]), 0, 0, 12, 
        -1
      ));
      
      println!("TEST-7...{}", driver(
        Vec::from([50, -70, -30, -54, 6, -10, 70, 84, 5]), 0, 8, 27, 
        -1
      ));
      
      println!("TEST-8...{}", driver(
        Vec::from([0, 1, 5]), 0, 2, 14, 
        -1
      ));
      
      println!("TEST-9...{}", driver(
        Vec::from([59, 21, 28, 3, 14, 5]), 0, 5, 28, 
        2
      ));
      
  }
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 );
  }