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:
Java Program to Implement LinkedBlockingDeque API
Guide to Spring 5 WebFlux
Multi Dimensional ArrayList in Java
Shuffling Collections In Java
Jackson – Marshall String to JsonNode
Java 8 Predicate Chain
Introduction to Spring Boot CLI
Guide to Guava Table
Java Web Services – JAX-WS – SOAP
Giới thiệu về Stream API trong Java 8
Hướng dẫn Java Design Pattern – Chain of Responsibility
Java Program to Compute Cross Product of Two Vectors
Java Scanner hasNext() vs. hasNextLine()
Java Program to Check Whether a Weak Link i.e. Articulation Vertex Exists in a Graph
Hướng dẫn sử dụng luồng vào ra ký tự trong Java
Default Password Encoder in Spring Security 5
ThreadPoolTaskExecutor corePoolSize vs. maxPoolSize
Java IO vs NIO
Logging a Reactive Sequence
Java Program to Show the Duality Transformation of Line and Point
Java Program to Find Median of Elements where Elements are Stored in 2 Different Arrays
Configure a Spring Boot Web Application
How to Get the Last Element of a Stream in Java?
Spring Boot Tutorial – Bootstrap a Simple Application
Java Program to Implement Counting Sort
Java – Create a File
Sorting Query Results with Spring Data
Hướng dẫn Java Design Pattern – Command
Period and Duration in Java
Java Program to Check Whether a Directed Graph Contains a Eulerian Cycle
A Guide to HashSet in Java
Lập trình hướng đối tượng (OOPs) trong java