title: Efficient Search In An Array Where Difference Between Adjacent Is 1
signature: func efficientSearchInAnArrayWhereDifferenceBetweenAdjacentIs1(arr []int, n int, x int) int {
test_code: package main
  
  import (
      "fmt"
      "reflect"
      "math"
      "sort"
  )
  
  // SOLUTION CODE
  // ===================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE
  // ===================================
  func validateSolution(actual int, expected int) bool {
      return reflect.DeepEqual(actual,expected)
  }
  
  func driver(arr []int, n int, x int, expected int) string {
      if validateSolution(PLACEHOLDER_FN_NAME(arr, n, x),expected) {
              return "PASSED"
      }
      return "FAILED"
  
  }
  
  func main() {
  
      // Use imports to avoid undefined errors
      var _ = reflect.DeepEqual
      _ = math.Abs
      _ = sort.Sort
      result := ""
      result = driver([]int{5, 4, 5, 6, 5, 4, 3, 2}, 
  	29, 
  	6, 3)
      fmt.Printf("TEST-0...%s\n", result)
      
      result = driver([]int{5, 4, 5, 6, 5, 4, 3, 2}, 
  	19, 
  	3, 6)
      fmt.Printf("TEST-1...%s\n", result)
      
      result = driver([]int{0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1}, 
  	37, 
  	1, 14)
      fmt.Printf("TEST-2...%s\n", result)
      
      result = driver([]int{50, 51, 52, 51, 50, 49, 48}, 
  	17, 
  	49, 5)
      fmt.Printf("TEST-3...%s\n", result)
      
      result = driver([]int{-86, -68, -32, -6, 6, 10, 30, 34, 58, 92}, 
  	6, 
  	6, -1)
      fmt.Printf("TEST-4...%s\n", result)
      
      result = driver([]int{1, 1, 1, 0, 0, 1, 0, 0, 0, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 0, 0}, 
  	27, 
  	22, -1)
      fmt.Printf("TEST-5...%s\n", result)
      
      result = driver([]int{58}, 
  	0, 
  	0, -1)
      fmt.Printf("TEST-6...%s\n", result)
      
      result = driver([]int{-64, 78, 58, 36, 48, 80, -80, 74, -98, 46, -48, 24, 80, 72, 90, -46, 14, 68, 38, 58, -54, 80, 44, -62, 34, -28, 92, 84, 90, 44, -26, 88, 18, 22, -32, 54, 58, 92}, 
  	24, 
  	34, -1)
      fmt.Printf("TEST-7...%s\n", result)
      
      result = driver([]int{0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1}, 
  	35, 
  	1, 21)
      fmt.Printf("TEST-8...%s\n", result)
      
      result = driver([]int{5}, 
  	0, 
  	0, -1)
      fmt.Printf("TEST-9...%s\n", result)
      
          
  }
source_py: def efficient_search_in_an_array_where_difference_between_adjacent_is_1(arr, n, x):
      i = 0
      while (i <= (n - 1)):
          if (arr[i] == x):
              return i
          i += abs((arr[i] - x))
      return (- 1)
source_cpp: int efficient_search_in_an_array_where_difference_between_adjacent_is_1(vector<int> arr, int n, int x) {
    int i = 0;
    while ( i <= n - 1 ) {
      if ( arr [ i ] == x ) return i;
      i += abs ( arr [ i ] - x );
    }
    return - 1;
  }