title: Check Array Represents Inorder Binary Search Tree Not
signature: func checkArrayRepresentsInorderBinarySearchTreeNot(arr []int, n int) bool {
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;
  }