This is a java program to generate and print all the permutation of the Numbers. User first enters the element in the set and then actual elements. The notion of permutation relates to the act of permuting, or rearranging, members of a set into a particular sequence or order (unlike combinations, which are selections that disregard order). For example, there are six permutations of the set {1,2,3}, namely (1,2,3), (1,3,2), (2,1,3), (2,3,1), (3,1,2), and (3,2,1).
Here is the source code of the Java Program to Generate All Possible Combinations of a Given List of Numbers. The Java program is successfully compiled and run on a Windows system. The program output is also shown below.
//This is a java program to perform all permutation of given list of numbers of a specific length
import java.util.Random;
import java.util.Scanner;
public class Permute_All_List_Numbers
{
static void permute(int[] a, int k)
{
if (k == a.length)
{
for (int i = 0; i < a.length; i++)
{
System.out.print(" [" + a[i] + "] ");
}
System.out.println();
}
else
{
for (int i = k; i < a.length; i++)
{
int temp = a[k];
a[k] = a[i];
a[i] = temp;
permute(a, k + 1);
temp = a[k];
a[k] = a[i];
a[i] = temp;
}
}
}
public static void main(String args[])
{
Random random = new Random();
Scanner sc = new Scanner(System.in);
System.out.println("Enter the length of list: ");
int N = sc.nextInt();
int[] sequence = new int[N];
for (int i = 0; i < N; i++)
sequence[i] = Math.abs(random.nextInt(100));
System.out.println("The original sequence is: ");
for (int i = 0; i < N; i++)
System.out.print(sequence[i] + " ");
System.out.println("\nThe permuted sequences are: ");
permute(sequence, 0);
sc.close();
}
}
Output:
$ java Permute_All_List_Numbers.java $ java Permute_All_List_Numbers Enter the length of list: 3 The original sequence is: 15 61 16 The permuted sequences are: [15] [61] [16] [15] [16] [61] [61] [15] [16] [61] [16] [15] [16] [61] [15] [16] [15] [61] Enter the length of list: 4 The original sequence is: 50 98 4 61 The permuted sequences are: [50] [98] [4] [61] [50] [98] [61] [4] [50] [4] [98] [61] [50] [4] [61] [98] [50] [61] [4] [98] [50] [61] [98] [4] [98] [50] [4] [61] [98] [50] [61] [4] [98] [4] [50] [61] [98] [4] [61] [50] [98] [61] [4] [50] [98] [61] [50] [4] [4] [98] [50] [61] [4] [98] [61] [50] [4] [50] [98] [61] [4] [50] [61] [98] [4] [61] [50] [98] [4] [61] [98] [50] [61] [98] [4] [50] [61] [98] [50] [4] [61] [4] [98] [50] [61] [4] [50] [98] [61] [50] [4] [98] [61] [50] [98] [4]
Related posts:
Spring – Injecting Collections
Java Program to Implement Adjacency Matrix
Exploring the Spring Boot TestRestTemplate
CharSequence vs. String in Java
Spring Boot - OAuth2 with JWT
How to Delay Code Execution in Java
Java – Write to File
HttpClient 4 – Follow Redirects for POST
HashSet trong Java hoạt động như thế nào?
OAuth2.0 and Dynamic Client Registration
Java Program to Implement Best-First Search
Spring 5 Testing with @EnabledIf Annotation
Java Program to Repeatedly Search the Same Text (such as Bible by building a Data Structure)
New Features in Java 8
Java Program to Implement ConcurrentLinkedQueue API
Creating a Web Application with Spring 5
Java Program to Implement Sorted Array
Hướng dẫn Java Design Pattern – Command
Lớp TreeMap trong Java
Java Program to Implement Floyd-Warshall Algorithm
Java – Reader to InputStream
Java Program to Check if a Given Set of Three Points Lie on a Single Line or Not
Java Program to Implement Control Table
Java List UnsupportedOperationException
Comparing Arrays in Java
Java equals() and hashCode() Contracts
Introduction to Spring Method Security
Java Program to Apply Above-Below-on Test to Find the Position of a Point with respect to a Line
Introduction to Liquibase Rollback
Java Program to Implement Sorted Singly Linked List
Hướng dẫn Java Design Pattern – Iterator
Java Program to Implement Lloyd’s Algorithm