title: Recursive C Program Linearly Search Element Given Array
signature: fun recursiveCProgramLinearlySearchElementGivenArray(arr: ArrayList<Int>, l: Int, r: Int, x: Int): Int {
test_code: package main
  
  import kotlin.text.*
  import kotlin.math.*
  
  
  // SOLUTION CODE
  // ===================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE
  // ===================================
  fun validateSolution(actual:Int, expected:Int):Boolean{
    return actual.equals(expected)
  }
  fun driver(arr: ArrayList<Int>, l: Int, r: Int, x: Int, expected:Int):String {
      try{
        if (validateSolution(PLACEHOLDER_FN_NAME(arr, l, r, x), expected)) {
                return "PASSED"
        }
        return "FAILED"
      } catch (e: Exception){
        return e::class.simpleName as String
      }
  
  }
  
  fun main() {
      var result: String = ""
      result = driver(arrayListOf(10, 74, 5), 0, 2, 1, -1)
      println("TEST-0...${result}")
      
      result = driver(arrayListOf(-90, 72, 36, 96, 42, 0, -66, 5), 0, 7, 96, 3)
      println("TEST-1...${result}")
      
      result = driver(arrayListOf(0, 5), 0, 1, -1, -1)
      println("TEST-2...${result}")
      
      result = driver(arrayListOf(99, 70, 67, 5), 0, 3, 3, -1)
      println("TEST-3...${result}")
      
      result = driver(arrayListOf(-98, -98, -26, -26, -24, -18, -16, 80, 5), 0, 8, 80, 7)
      println("TEST-4...${result}")
      
      result = driver(arrayListOf(1, 1, 1, 1, 0, 1, 5), 0, 6, 1, 0)
      println("TEST-5...${result}")
      
      result = driver(arrayListOf(1, 5, 12, 12, 17, 17, 12, 95, 96, 98, 5), 0, 0, 12, -1)
      println("TEST-6...${result}")
      
      result = driver(arrayListOf(50, -70, -30, -54, 6, -10, 70, 84, 5), 0, 8, 27, -1)
      println("TEST-7...${result}")
      
      result = driver(arrayListOf(0, 1, 5), 0, 2, 14, -1)
      println("TEST-8...${result}")
      
      result = driver(arrayListOf(59, 21, 28, 3, 14, 5), 0, 5, 28, 2)
      println("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 );
  }