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:
Split a String in Java
Spring REST API + OAuth2 + Angular
Spring Boot - Enabling HTTPS
Hướng dẫn Java Design Pattern – Template Method
Java Program to Encode a Message Using Playfair Cipher
Wrapper Classes in Java
Practical Java Examples of the Big O Notation
Testing an OAuth Secured API with Spring MVC
The XOR Operator in Java
Java Program to Find Nearest Neighbor Using Linear Search
Java Program to Implement a Binary Search Algorithm for a Specific Search Sequence
Hướng dẫn Java Design Pattern – Visitor
Spring Boot - Unit Test Cases
OAuth2.0 and Dynamic Client Registration
Intro to Spring Boot Starters
Sử dụng CyclicBarrier trong Java
A Guide to the finalize Method in Java
Returning Image/Media Data with Spring MVC
Introduction to Spring Security Expressions
Hướng dẫn Java Design Pattern – Null Object
Netflix Archaius with Various Database Configurations
How to Break from Java Stream forEach
Java Map With Case-Insensitive Keys
Hướng dẫn Java Design Pattern – Strategy
Guide to the Java Queue Interface
Concurrent Test Execution in Spring 5
Java Program to Implement Pagoda
Vấn đề Nhà sản xuất (Producer) – Người tiêu dùng (Consumer) và đồng bộ hóa các luồng trong Java
Java Program to find the maximum subarray sum using Binary Search approach
Spring Data MongoDB – Indexes, Annotations and Converters
Lớp lồng nhau trong java (Java inner class)
Spring Security 5 for Reactive Applications