Generate all cyclic permutations of a number
Last Updated :
07 Jan, 2024
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_0 , a_1 , ..., a_n , a cyclic permutation of one place to the left would yield a_1 , ..., a_n , a_0 , and a cyclic permutation of one place to the right would yield a_n , a_0 , a_1 , ....
Examples:
Input : 123
Output : 123
312
231
Input : 5674
Output : 5674
4567
7456
6745
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++
// Program to generate all cyclic permutations
// of number
#include <bits/stdc++.h>
using namespace std;
// Function to count the total number of digits
// in a number.
int countdigits(int N)
{
int count = 0;
while (N) {
count++;
N = N / 10;
}
return count;
}
// Function to generate all cyclic permutations
// of a number
void cyclic(int N)
{
int num = N;
int n = countdigits(N);
while (1) {
cout << num << endl;
// Following three lines generates a
// circular permutation of a number.
int rem = num % 10;
int div = 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
int main()
{
int N = 5674;
cyclic(N);
return 0;
}
// Java Program to generate all
// cyclic permutations of number
public class GFG
{
// Function to count the total number
// of digits in a number.
static int countdigits(int N)
{
int count = 0;
while (N>0) {
count++;
N = N / 10;
}
return count;
}
// Function to generate all cyclic
// permutations of a number
static void cyclic(int N)
{
int num = N;
int n = countdigits(N);
while (true) {
System.out.println(num);
// Following three lines generates a
// circular permutation of a number.
int rem = num % 10;
int dev = 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
public static void main (String[] args) {
int N = 5674;
cyclic(N);
}
}
/* This code is contributed by Mr. Somesh Awasthi */
# Python3 Program to
# generate all cyclic
# permutations of number
import math
# Function to count the
# total number of digits
# in a number.
def countdigits(N):
count = 0;
while (N):
count = count + 1;
N = int(math.floor(N / 10));
return count;
# Function to generate
# all cyclic permutations
# of a number
def cyclic(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
// C# Program to generate all
// cyclic permutations of number
using System;
class GFG
{
// Function to count the total number
// of digits in a number.
static int countdigits(int N)
{
int count = 0;
while (N > 0) {
count++;
N = N / 10;
}
return count;
}
// Function to generate all cyclic
// permutations of a number
static void cyclic(int N)
{
int num = N;
int n = countdigits(N);
while (true) {
Console.WriteLine(num);
// Following three lines generates a
// circular permutation of a number.
int rem = num % 10;
int dev = 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
public static void Main ()
{
int N = 5674;
cyclic(N);
}
}
// This code is contributed by nitin mittal
<?php
// PHP Program to generate all
// cyclic permutations of number
// Function to count the total
// number of digits in a number.
function countdigits($N)
{
$count = 0;
while ($N)
{
$count++;
$N = floor($N / 10);
}
return $count;
}
// Function to generate all
// cyclic permutations of a number
function cyclic($N)
{
$num = $N;
$n = countdigits($N);
while (1)
{
echo ($num);
echo "\n" ;
// Following three lines generates a
// circular permutation 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
?>
<script>
// javascript Program to generate all
// cyclic permutations of number
// Function to count the total number
// of digits in a number.
function countdigits(N)
{
var count = 0;
while (N>0) {
count++;
N = parseInt(N / 10);
}
return count;
}
// Function to generate all cyclic
// permutations of a number
function cyclic(N)
{
var num = N;
var n = countdigits(N);
while (true) {
document.write(num+"<br>");
// Following three lines generates a
// circular permutation of a number.
var rem = num % 10;
var dev = parseInt(num / 10);
num = parseInt(((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
var N = 5674;
cyclic(N);
// This code is contributed by Amit Katiyar
</script>
Output5674
4567
7456
6745
Time Complexity: O(N), where N is the number of digits
Auxiliary Space: O(1)
Similar Reads
DSA Tutorial - Learn Data Structures and Algorithms DSA (Data Structures and Algorithms) is the study of organizing data efficiently using data structures like arrays, stacks, and trees, paired with step-by-step procedures (or algorithms) to solve problems effectively. Data structures manage how data is stored and accessed, while algorithms focus on
7 min read
Quick Sort QuickSort is a sorting algorithm based on the Divide and Conquer that picks an element as a pivot and partitions the given array around the picked pivot by placing the pivot in its correct position in the sorted array. It works on the principle of divide and conquer, breaking down the problem into s
12 min read
Merge Sort - Data Structure and Algorithms Tutorials Merge sort is a popular sorting algorithm known for its efficiency and stability. It follows the divide-and-conquer approach. It works by recursively dividing the input array into two halves, recursively sorting the two halves and finally merging them back together to obtain the sorted array. Merge
14 min read
Data Structures Tutorial Data structures are the fundamental building blocks of computer programming. They define how data is organized, stored, and manipulated within a program. Understanding data structures is very important for developing efficient and effective algorithms. What is Data Structure?A data structure is a st
2 min read
Bubble Sort Algorithm Bubble Sort is the simplest sorting algorithm that works by repeatedly swapping the adjacent elements if they are in the wrong order. This algorithm is not suitable for large data sets as its average and worst-case time complexity are quite high.We sort the array using multiple passes. After the fir
8 min read
Breadth First Search or BFS for a Graph Given a undirected graph represented by an adjacency list adj, where each adj[i] represents the list of vertices connected to vertex i. Perform a Breadth First Search (BFS) traversal starting from vertex 0, visiting vertices from left to right according to the adjacency list, and return a list conta
15+ min read
Binary Search Algorithm - Iterative and Recursive Implementation Binary Search Algorithm is a searching algorithm used in a sorted array by repeatedly dividing the search interval in half. The idea of binary search is to use the information that the array is sorted and reduce the time complexity to O(log N). Binary Search AlgorithmConditions to apply Binary Searc
15 min read
Insertion Sort Algorithm Insertion sort is a simple sorting algorithm that works by iteratively inserting each element of an unsorted list into its correct position in a sorted portion of the list. It is like sorting playing cards in your hands. You split the cards into two groups: the sorted cards and the unsorted cards. T
9 min read
Array Data Structure Guide In this article, we introduce array, implementation in different popular languages, its basic operations and commonly seen problems / interview questions. An array stores items (in case of C/C++ and Java Primitive Arrays) or their references (in case of Python, JS, Java Non-Primitive) at contiguous
4 min read
Sorting Algorithms A Sorting Algorithm is used to rearrange a given array or list of elements in an order. For example, a given array [10, 20, 5, 2] becomes [2, 5, 10, 20] after sorting in increasing order and becomes [20, 10, 5, 2] after sorting in decreasing order. There exist different sorting algorithms for differ
3 min read