Generate all cyclic permutations of a number

Given a number N, our task is to generate all the possible cyclic permutations of the number.

A cyclic permutation shifts all the elements of a set by a fixed offset. For a set with elements , , …, , a cyclic permutation of one place to the left would yield , …, , , and a cyclic permutation of one place to the right would yield , , , ….

The idea is to generate next permutation of a number using below formula.

rem = num % 10;
div = num / 10;
num = (pow(10, n - 1)) * rem + div;

While repeating above steps, if we come back to original number, we stop and return.

C++

filter_none

editclose

play_arrow

linkbrightness_4code

// Program to generate all cyclic permutations

// of number

#include <bits/stdc++.h>

usingnamespacestd;

// Function to count the total number of digits

// in a number.

intcountdigits(intN)

{

intcount = 0;

while(N) {

count++;

N = N / 10;

}

returncount;

}

// Function to generate all cyclic permutations

// of a number

voidcyclic(intN)

{

intnum = N;

intn = countdigits(N);

while(1) {

cout << num << endl;

// Following three lines generates a

// circular pirmutation of a number.

intrem = num % 10;

intdiv= num / 10;

num = (pow(10, n - 1)) * rem + div;

// If all the permutations are checked

// and we obtain original number exit

// from loop.

if(num == N)

break;

}

}

// Driver Program

intmain()

{

intN = 5674;

cyclic(N);

return0;

}

chevron_right

filter_none

Java

filter_none

editclose

play_arrow

linkbrightness_4code

// Java Program to generate all

// cyclic permutations of number

classGFG

{

// Function to count the total number

// of digits in a number.

staticintcountdigits(intN)

{

intcount = 0;

while(N>0) {

count++;

N = N / 10;

}

returncount;

}

// Function to generate all cyclic

// permutations of a number

staticvoidcyclic(intN)

{

intnum = N;

intn = countdigits(N);

while(true) {

System.out.println(num);

// Following three lines generates a

// circular pirmutation of a number.

intrem = num % 10;

intdev = num / 10;

num = (int)((Math.pow(10, n - 1)) *

rem + dev);

// If all the permutations are

// checked and we obtain original

// number exit from loop.

if(num == N)

break;

}

}

// Driver Program

publicstaticvoidmain (String[] args) {

intN = 5674;

cyclic(N);

}

}

/* This code is contributed by Mr. Somesh Awasthi */

chevron_right

filter_none

Python3

filter_none

editclose

play_arrow

linkbrightness_4code

# Python3 Program to

# generate all cyclic

# permutations of number

importmath

# Function to count the

# total number of digits

# in a number.

defcountdigits(N):

count =0;

while(N):

count =count +1;

N =int(math.floor(N /10));

returncount;

# Function to generate

# all cyclic permutations

# of a number

defcyclic(N):

num =N;

n =countdigits(N);

while(1):

print(int(num));

# Following three lines

# generates a circular

# permutation of a number.

rem =num %10;

div =math.floor(num /10);

num =((math.pow(10, n -1)) *

rem +div);

# If all the permutations

# are checked and we obtain

# original number exit from loop.

if(num ==N):

break;

# Driver Code

N =5674;

cyclic(N);

# This code is contributed by mits

chevron_right

filter_none

C#

filter_none

editclose

play_arrow

linkbrightness_4code

// C# Program to generate all

// cyclic permutations of number

usingSystem;

classGFG

{

// Function to count the total number

// of digits in a number.

staticintcountdigits(intN)

{

intcount = 0;

while(N > 0) {

count++;

N = N / 10;

}

returncount;

}

// Function to generate all cyclic

// permutations of a number

staticvoidcyclic(intN)

{

intnum = N;

intn = countdigits(N);

while(true) {

Console.WriteLine(num);

// Following three lines generates a

// circular permutation of a number.

intrem = num % 10;

intdev = num / 10;

num = (int)((Math.Pow(10, n - 1)) *

rem + dev);

// If all the permutations are

// checked and we obtain original

// number exit from loop.

if(num == N)

break;

}

}

// Driver Program

publicstaticvoidMain ()

{

intN = 5674;

cyclic(N);

}

}

// This code is contributed by nitin mittal

chevron_right

filter_none

PHP

filter_none

editclose

play_arrow

linkbrightness_4code

<?php

// PHP Program to generate all

// cyclic permutations of number

// Function to count the total

// number of digits in a number.

functioncountdigits($N)

{

$count= 0;

while($N)

{

$count++;

$N= floor($N/ 10);

}

return$count;

}

// Function to generate all

// cyclic permutations of a number

functioncyclic($N)

{

$num= $N;

$n= countdigits($N);

while(1)

{

echo($num);

echo"\n";

// Following three lines generates a

// circular pirmutation of a number.

$rem= $num% 10;

$div= floor($num/ 10);

$num= (pow(10, $n- 1)) * $rem+ $div;

// If all the permutations are checked

// and we obtain original number exit

// from loop.

if($num== $N)

break;

}

}

// Driver Code

$N= 5674;

cyclic($N);

// This code is contributed by nitin mittal

?>

chevron_right

filter_none

Output:

5674
4567
7456
6745

This article is contributed by Vineet Joshi. If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.