Skip to content
Related Articles

Related Articles

Table of Contents

Improve Article
Save Article
Like Article

Check if array can be sorted by swapping pairs having GCD equal to the smallest element in the array

  • Last Updated : 13 Apr, 2021

Given an array arr[] of size N, the task is to check if an array can be sorted by swapping only the elements whose GCD (greatest common divisor) is equal to the smallest element of the array. Print “Yes” if it is possible to sort the array. Otherwise, print “No”.

Examples: 

Input: arr[] = {4, 3, 6, 6, 2, 9} 
Output: Yes 
Explanation: 
Smallest element in the array = 2 
Swap arr[0] and arr[2], since they have gcd equal to 2. Therefore, arr[] = {6, 3, 4, 6, 2, 9} 
Swap arr[0] and arr[4], since they have gcd equal to 2. Therefore, arr[] = {2, 3, 4, 6, 6, 9} 
 Input: arr[] = {2, 6, 2, 4, 5} 
Output: No 

Approach: The idea is to find the smallest element from the array and check if it is possible to sort the array. Below are the steps: 

  1. Find the smallest element of the array and store it in a variable, say mn.
  2. Store the array in a temporary array, say B[].
  3. Sort the original array arr[].
  4. Now, iterate over the array, if there is an element which is not divisible by mn and whose position is changed after sorting, then print “NO”. Otherwise, rearrange the elements divisible by mn by swapping it with other elements.
  5. If the position of all elements which are not divisible by mn remains unchanged, then print “YES”.

Below is the implementation of the above approach: 

C++




// C++ implementation of the above approach
#include <bits/stdc++.h>
using namespace std;
 
// Function to check if it is
// possible to sort array or not
void isPossible(int arr[], int N)
{
 
    // Store the smallest element
    int mn = INT_MAX;
 
    // Copy the original array
    int B[N];
 
    // Iterate over the given array
    for (int i = 0; i < N; i++) {
 
        // Update smallest element
        mn = min(mn, arr[i]);
 
        // Copy elements of arr[]
        // to array B[]
        B[i] = arr[i];
    }
 
    // Sort original array
    sort(arr, arr + N);
 
    // Iterate over the given array
    for (int i = 0; i < N; i++) {
 
        // If the i-th element is not
        // in its sorted place
        if (arr[i] != B[i]) {
 
            // Not possible to swap
            if (B[i] % mn != 0) {
                cout << "No";
                return;
            }
        }
    }
 
    cout << "Yes";
    return;
}
 
// Driver Code
int main()
{
    // Given array
    int N = 6;
    int arr[] = { 4, 3, 6, 6, 2, 9 };
 
    // Function Call
    isPossible(arr, N);
 
    return 0;
}
Java



// Java implementation of
// the above approach
import java.util.*;
class GFG{
 
// Function to check if it is
// possible to sort array or not
static void isPossible(int arr[],
                       int N)
{
  // Store the smallest element
  int mn = Integer.MAX_VALUE;
 
  // Copy the original array
  int []B = new int[N];
 
  // Iterate over the given array
  for (int i = 0; i < N; i++)
  {
    // Update smallest element
    mn = Math.min(mn, arr[i]);
 
    // Copy elements of arr[]
    // to array B[]
    B[i] = arr[i];
  }
 
  // Sort original array
  Arrays.sort(arr);
 
  // Iterate over the given array
  for (int i = 0; i < N; i++)
  {
    // If the i-th element is not
    // in its sorted place
    if (arr[i] != B[i])
    {
      // Not possible to swap
      if (B[i] % mn != 0)
      {
        System.out.print("No");
        return;
      }
    }
  }
  System.out.print("Yes");
  return;
}
 
// Driver Code
public static void main(String[] args)
{
  // Given array
  int N = 6;
  int arr[] = {4, 3, 6, 6, 2, 9};
 
  // Function Call
  isPossible(arr, N);
}
}
 
// This code is contributed by 29AjayKumar
Python3



# Python3 implementation of
# the above approach
import sys
 
# Function to check if it is
# possible to sort array or not
def isPossible(arr, N):
   
    # Store the smallest element
    mn = sys.maxsize;
 
    # Copy the original array
    B = [0] * N;
 
    # Iterate over the given array
    for i in range(N):
       
        # Update smallest element
        mn = min(mn, arr[i]);
 
        # Copy elements of arr
        # to array B
        B[i] = arr[i];
 
    # Sort original array
    arr.sort();
 
    # Iterate over the given array
    for i in range(N):
       
        # If the i-th element is not
        # in its sorted place
        if (arr[i] != B[i]):
           
            # Not possible to swap
            if (B[i] % mn != 0):
                print("No");
                return;
 
    print("Yes");
    return;
 
# Driver Code
if __name__ == '__main__':
   
    # Given array
    N = 6;
    arr = [4, 3, 6, 6, 2, 9];
 
    # Function Call
    isPossible(arr, N);
 
# This code is contributed by 29AjayKumar
C#



// C# implementation of
// the above approach
using System;
class GFG{
 
// Function to check if it is
// possible to sort array or not
static void isPossible(int []arr,
                       int N)
{
  // Store the smallest element
  int mn = int.MaxValue;
 
  // Copy the original array
  int []B = new int[N];
 
  // Iterate over the given array
  for (int i = 0; i < N; i++)
  {
    // Update smallest element
    mn = Math.Min(mn, arr[i]);
 
    // Copy elements of []arr
    // to array []B
    B[i] = arr[i];
  }
 
  // Sort original array
  Array.Sort(arr);
 
  // Iterate over the given array
  for (int i = 0; i < N; i++)
  {
    // If the i-th element is not
    // in its sorted place
    if (arr[i] != B[i])
    {
      // Not possible to swap
      if (B[i] % mn != 0)
      {
        Console.Write("No");
        return;
      }
    }
  }
  Console.Write("Yes");
  return;
}
 
// Driver Code
public static void Main(String[] args)
{
  // Given array
  int N = 6;
  int []arr = {4, 3, 6, 6, 2, 9};
 
  // Function Call
  isPossible(arr, N);
}
}
 
// This code is contributed by Rajput-Ji
Javascript



<script>
 
// JavaScript program for
// the above approach
 
// Function to check if it is
// possible to sort array or not
function isPossible(arr,
                       N)
{
  // Store the smallest element
  let mn = Number.MAX_VALUE;
  
  // Copy the original array
  let B = [];
  
  // Iterate over the given array
  for (let i = 0; i < N; i++)
  {
    // Update smallest element
    mn = Math.min(mn, arr[i]);
  
    // Copy elements of arr[]
    // to array B[]
    B[i] = arr[i];
  }
  
  // Sort original array
  arr.sort();
  
  // Iterate over the given array
  for (let i = 0; i < N; i++)
  {
    // If the i-th element is not
    // in its sorted place
    if (arr[i] != B[i])
    {
      // Not possible to swap
      if (B[i] % mn != 0)
      {
        document.write("No");
        return;
      }
    }
  }
  document.write("Yes");
  return;
}
 
 
// Driver code
 
  // Given array
  let N = 6;
  let arr = [4, 3, 6, 6, 2, 9];
  
  // Function Call
  isPossible(arr, N);
                             
</script>
Output: 
Yes
 
Time Complexity: O(NlogN) 
Auxiliary Space: O(N)

My Personal Notes
arrow_drop_up
Previous
Priority Queue using Binary Heap
Next

Check if a subarray of size K exists whose elements form a number divisible by 3
Recommended Articles
Page :
Check if array can be sorted by swapping pairs with GCD of set bits count equal to that of the smallest array element
17, Sep 20
Rearrange array to make it non-decreasing by swapping pairs having GCD equal to minimum array element
23, Sep 20
Check if an array of pairs can be sorted by swapping pairs with different first elements
29, Apr 21
Smallest subsequence having GCD equal to GCD of given array
20, Oct 20
Pair of integers having least GCD among all given pairs having GCD exceeding K
16, Sep 20
Check if an array can be sorted by swapping pairs from indices consisting of unequal elements in another array
03, Feb 21
Check if an array can be sorted by swapping adjacent elements such that each element is swapped even number of times
30, Jul 21
Check if two binary strings can be made equal by swapping pairs of unequal characters
20, Jan 21
Check if two arrays can be made equal by swapping pairs of one of the arrays
03, Feb 21
Count pairs from an array having GCD equal to the minimum element in the pair
27, Apr 21
Sort a given Array by swapping only pairs with GCD as 1
30, Nov 21
Check if an array can be converted to another given array by swapping pairs of unequal elements
15, Feb 21
Count of all possible pairs having sum of LCM and GCD equal to N
31, Jul 20
Check if a string can be made equal to another string by swapping or replacement of characters
24, Jan 21
Check if two binary strings can be made equal by swapping 1s occurring before 0s
18, Jan 21
Smallest number possible by swapping adjacent even odd pairs
29, May 20
Check if two sorted arrays can be merged to form a sorted array with no adjacent pair from the same array
16, Nov 20
Generate an N-length array having GCD of all its pairs present in a given 2D array
30, Jul 21
Check if a sorted array can be divided in pairs whose sum is k
02, Nov 15
Check if the array can be sorted only if the elements on given positions can be swapped
07, May 20
Check if two array of string are equal by performing swapping operations
12, Oct 21
Number of ways to select equal sized subarrays from two arrays having atleast K equal pairs of elements
06, May 20
Find the winner of game of removing array elements having GCD equal to 1
29, Dec 20
Count of pairs having each element equal to index of the other from an Array
30, Jul 20
Article Contributed By :
https://media.geeksforgeeks.org/auth/avatar.png
__mahakal
@__mahakal
Vote for difficulty





Improved By :
Article Tags :
Practice Tags :
Report Issue

We use cookies to ensure you have the best browsing experience on our website. By using our site, you
acknowledge that you have read and understood our
Cookie Policy &
        Privacy Policy

Lightbox

Start Your Coding Journey Now!