title: Check Array Represents Inorder Binary Search Tree Not
signature: func checkArrayRepresentsInorderBinarySearchTreeNot(arr []int, n int) bool {
test_code: package main
  
  import (
      "fmt"
      "reflect"
      "math"
      "sort"
  )
  
  // SOLUTION CODE
  // ===================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE
  // ===================================
  func validateSolution(actual bool, expected bool) bool {
      return reflect.DeepEqual(actual,expected)
  }
  
  func driver(arr []int, n int, expected bool) string {
      if validateSolution(PLACEHOLDER_FN_NAME(arr, n),expected) {
              return "PASSED"
      }
      return "FAILED"
  
  }
  
  func main() {
  
      // Use imports to avoid undefined errors
      var _ = reflect.DeepEqual
      _ = math.Abs
      _ = sort.Sort
      result := ""
      result = driver([]int{2, 3, 4, 10, 11, 13, 17, 19, 23, 26, 28, 29, 30, 34, 35, 37, 38, 38, 43, 49, 49, 50, 52, 53, 55, 55, 57, 58, 58, 59, 64, 66, 67, 70, 72, 72, 75, 77, 77, 87, 89, 89, 90, 91, 98, 99, 99, 99}, 
  	46, true)
      fmt.Printf("TEST-0...%s\n", result)
      
      result = driver([]int{56, -94, -26, -52, 58, -66, -52, -66, -94, 44, 38, -66, 70, -70, -80, -78, -72, -60, -76, 68, -50, 32, -16, 84, 74, -42, 98, -8, 72, 26, 24, 6, 24, 86, 86, 78, -92, 80, 32, -74, 26, 50, 92, 4, 2, -34, -2, -18, -10}, 
  	30, false)
      fmt.Printf("TEST-1...%s\n", result)
      
      result = driver([]int{0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1}, 
  	13, true)
      fmt.Printf("TEST-2...%s\n", result)
      
      result = driver([]int{38, 79, 76, 92, 92}, 
  	2, true)
      fmt.Printf("TEST-3...%s\n", result)
      
      result = driver([]int{-42, -28, 2, 32, 50, 56, 86, 96, 98}, 
  	7, true)
      fmt.Printf("TEST-4...%s\n", result)
      
      result = driver([]int{1, 0, 0, 1, 1, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1}, 
  	11, false)
      fmt.Printf("TEST-5...%s\n", result)
      
      result = driver([]int{1, 9, 12, 21, 21, 24, 34, 55, 60, 63, 67, 68, 88, 89, 91, 94, 98, 99}, 
  	9, true)
      fmt.Printf("TEST-6...%s\n", result)
      
      result = driver([]int{-96, 96, -98, -42, -74, 40, 42, 50, -46, -52, 8, -46, 48, 88, -78, -72, -10, -20, 98, -40, -18, 36, 4, 46, 52, 28, -88, -28, -28, -86}, 
  	29, false)
      fmt.Printf("TEST-7...%s\n", result)
      
      result = driver([]int{0, 0, 0, 0, 1, 1}, 
  	3, true)
      fmt.Printf("TEST-8...%s\n", result)
      
      result = driver([]int{66, 12, 48, 82, 33, 77, 99, 98, 14, 92}, 
  	7, false)
      fmt.Printf("TEST-9...%s\n", result)
      
          
  }
source_py: def check_array_represents_inorder_binary_search_tree_not(arr, n):
      if ((n == 0) or (n == 1)):
          return True
      for i in range(1, n, 1):
          if (arr[(i - 1)] > arr[i]):
              return False
      return True
source_cpp: bool check_array_represents_inorder_binary_search_tree_not(vector<int> arr, int n) {
    if ( n == 0 || n == 1 ) return true;
    for ( int i = 1;
    i < n;
    i ++ ) if ( arr [ i - 1 ] > arr [ i ] ) return false;
    return true;
  }