Check if it is possible to sort an array with conditional swapping of adjacent allowed
We are given an unsorted array of integers in the range from 0 to n-1. We are allowed to swap adjacent elements in array many number of times but only if the absolute difference between these element is 1. Check if it is possible to sort the array.If yes then print “yes” else “no”.
Examples:
Input : arr[] = {1, 0, 3, 2}
Output : yes
Explanation:- We can swap arr[0] and arr[1].
Again we swap arr[2] and arr[3].
Final arr[] = {0, 1, 2, 3}.
Input : arr[] = {2, 1, 0}
Output : no
Although the problems looks complex at first look, there is a simple solution to it. If we traverse array from left to right and we make sure elements before an index i are sorted before we reach i, we must have maximum of arr[0..i-1] just before i. And this maximum must be either smaller than arr[i] or just one greater than arr[i]. In first case, we simply move ahead. In second case, we swap and move ahead.
Compare the current element with the next element in array.If current element is greater than next element then do following:-
- Check if difference between two numbers is 1 then swap it.
- else Return false.
If we reach end of array, we return true.
- C++
- Java
- Python3
- C#
- PHP
- Javascript
C++
// C++ program to check if we can sort// an array with adjacent swaps allowed#include<bits/stdc++.h>using namespace std;// Returns true if it is possible to sort// else false/bool checkForSorting(int arr[], int n){ for (int i=0; i<n-1; i++) { // We need to do something only if // previousl element is greater if (arr[i] > arr[i+1]) { if (arr[i] - arr[i+1] == 1) swap(arr[i], arr[i+1]); // If difference is more than // one, then not possible else return false; } } return true;}// Driver codeint main(){ int arr[] = {1,0,3,2}; int n = sizeof(arr)/sizeof(arr[0]); if (checkForSorting(arr, n)) cout << "Yes"; else cout << "No";} |
Java
Python3
C#
PHP
Javascript
Yes
Time Complexity=O(n)
Auxiliary Space=O(1)
