title: Check Possible Sort Array Conditional Swapping Adjacent Allowed
signature: func checkPossibleSortArrayConditionalSwappingAdjacentAllowed(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{1, 4, 12, 16, 37, 44, 47, 51, 55, 57, 57, 62, 62, 62, 64, 69, 69, 70, 72, 81, 81, 88, 89, 97}, 
  	15, true)
      fmt.Printf("TEST-0...%s\n", result)
      
      result = driver([]int{-86, 0, 14, -16, -12, -72, 62, -34, -72, 30, 84, -60, 84, -64, 50, 74, 18, -82, -64, -64, -74, -56, 86, 84, -32, -10, 20, 4, 8, 96, 82, 26, 42}, 
  	18, false)
      fmt.Printf("TEST-1...%s\n", result)
      
      result = driver([]int{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}, 
  	31, true)
      fmt.Printf("TEST-2...%s\n", result)
      
      result = driver([]int{48, 66, 83, 12, 77, 98, 18, 33, 21, 16, 28, 24, 46, 43}, 
  	13, false)
      fmt.Printf("TEST-3...%s\n", result)
      
      result = driver([]int{-92, -58, -36, -28, -6, 2, 4, 26, 48, 58, 60, 62, 62, 98}, 
  	10, true)
      fmt.Printf("TEST-4...%s\n", result)
      
      result = driver([]int{0, 0, 0, 1, 0, 1}, 
  	4, true)
      fmt.Printf("TEST-5...%s\n", result)
      
      result = driver([]int{22, 38, 41, 41, 42, 51, 54, 58, 68, 76, 80, 85}, 
  	9, true)
      fmt.Printf("TEST-6...%s\n", result)
      
      result = driver([]int{84, -38, 52, -72, -24, 82, 54, 74, 0}, 
  	8, false)
      fmt.Printf("TEST-7...%s\n", result)
      
      result = driver([]int{0, 1, 1}, 
  	2, true)
      fmt.Printf("TEST-8...%s\n", result)
      
      result = driver([]int{63, 31, 14, 19, 77, 64, 62, 23, 22, 19, 39, 9, 79, 1, 87, 29, 58, 3, 3, 39, 1, 39, 35, 64, 64}, 
  	13, false)
      fmt.Printf("TEST-9...%s\n", result)
      
          
  }
source_py: def check_possible_sort_array_conditional_swapping_adjacent_allowed(arr, n):
      for i in range(0, (n - 1)):
          if (arr[i] > arr[(i + 1)]):
              if ((arr[i] - arr[(i + 1)]) == 1):
                  (arr[i], arr[(i + 1)]) = (arr[(i + 1)], arr[i])
              else:
                  return False
      return True
source_cpp: bool check_possible_sort_array_conditional_swapping_adjacent_allowed(vector<int> arr, int n) {
    for ( int i = 0;
    i < n - 1;
    i ++ ) {
      if ( arr [ i ] > arr [ i + 1 ] ) {
        if ( arr [ i ] - arr [ i + 1 ] == 1 ) swap ( arr [ i ], arr [ i + 1 ] );
        else return false;
      }
    }
    return true;
  }