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 RequestMapping
Getting Started with GraphQL and Spring Boot
Java Program to Implement Bellman-Ford Algorithm
Checked and Unchecked Exceptions in Java
Java Program to Implement Regular Falsi Algorithm
Overview of Spring Boot Dev Tools
Java Program to Implement Sieve Of Sundaram
Java – Delete a File
Java Program to Implement Merge Sort on n Numbers Without tail-recursion
How to Change the Default Port in Spring Boot
Mệnh đề if-else trong java
Simple Single Sign-On with Spring Security OAuth2
Java Program to Perform integer Partition for a Specific Case
Guide to the Java TransferQueue
Hướng dẫn Java Design Pattern – Singleton
Java Program to Implement a Binary Search Tree using Linked Lists
How to Remove the Last Character of a String?
Java Program to Create a Minimal Set of All Edges Whose Addition will Convert it to a Strongly Conne...
Spring REST API + OAuth2 + Angular
Java Program to Implement ScapeGoat Tree
Java Program to Check whether Graph is a Bipartite using DFS
Loại bỏ các phần tử trùng trong một ArrayList như thế nào?
Hướng dẫn Java Design Pattern – Object Pool
Java Program to Find the Minimum value of Binary Search Tree
Java Program to Find the Median of two Sorted Arrays using Binary Search Approach
Create Java Applet to Simulate Any Sorting Technique
Reactive Flow with MongoDB, Kotlin, and Spring WebFlux
Java Program to Implement Hash Tables Chaining with List Heads
Giới thiệu Swagger – Công cụ document cho RESTfull APIs
Introduction to Spring Cloud OpenFeign
Registration – Activate a New Account by Email
Java Program to Find MST (Minimum Spanning Tree) using Prim’s Algorithm