Question

Hi, I have programming problem related to array, sorting, and. swap operation

A non-empty array A consisting of N integers is given. You can perform a single swap operation in array A. This operation takes two indices I and J, such that 0 S13 J<N, and exchanges the values of A[i] and A[J]. The goal is to check whether array A can be sorted into non-decreasing order by performing at most one swap operation. For example, consider array A such that: A[@] = 1 A[1] A[2] = 3 A[3] 3 A[4] = 7 After exchanging the values A[1] and A[3] we obtain an array (1,3, 3, 5, 7), which is sorted in non-decreasing order. Write a function: = 5 def solution (A) that, given a non-empty array A consisting of N integers, returns True if the array can be sorted into non-decreasing order by performing at most one swap operation or False otherwise.

Thank you,

Best Regards..

Answer 1

# Code for checking logic
def solution(A):
   temp_A = []
   N = len(A)
   count_diff = 0
   for item in A:
       temp_A.append(item)
   temp_A.sort()
  
   # Comparing 2 arrays
   for i in range(N):
       if A[i] != temp_A[i]:
           count_diff = count_diff + 1
   if count_diff == 0 or count_diff == 2:
       return True
   else:
       return False

# Declaring array of integers
A = [1,5,3,3,7]
#A = [1,3,5]
#A = [1,3,5,3,4]
result = solution(A)
if result:
   print("Yes array can be sorted with atmost one swap")
      
else:
   print("No array cannot be sorted with atmost one swap")