This is a java program to generate and print all the subsets of a given set as per lexicographical order, here we follow the numerical sequence. First generate all the subsets having only one element, then generate all the subsets having two elements and so on.
Here is the source code of the Java Program to Generate All Subsets of a Given Set in the Lexico-Graphic Order. 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 generate all permutation of n elements in lexicographic order import java.util.Random; import java.util.Scanner; public class Lexicographic_Permutation { public static int[] lexicographicOrder(int N) { int[] binary = new int[(int) Math.pow(2, N)]; for (int i = 0; i < Math.pow(2, N); i++) { int b = 1; binary[i] = 0; int num = i; while (num > 0) { binary[i] += (num % 2) * b; num /= 2; b = b * 10; } } return binary; } public static void main(String args[]) { Random random = new Random(); Scanner sc = new Scanner(System.in); System.out.println("Enter the number of elements in the set: "); 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 elements in the set : "); for (int i = 0; i < N; i++) System.out.print(sequence[i] + " "); for (int i = 1; i < N; i++) { int j = i; int temp = sequence[i]; while (j > 0 && temp < sequence[j - 1]) { sequence[j] = sequence[j - 1]; j = j - 1; } sequence[j] = temp; } int[] mask = new int[(int) Math.pow(2, N)]; mask = lexicographicOrder(N); System.out.println("\nThe permutations are: "); for (int i = 0; i < Math.pow(2, N); i++) { System.out.print("{ "); for (int j = 0; j < N; j++) { if (mask[i] % 10 == 1) System.out.print(sequence[j] + " "); mask[i] /= 10; } System.out.println("}"); } sc.close(); } }
Output:
$ javac Lexicographic_Permutation.java $ java Lexicographic_Permutation Enter the number of elements in the set: 5 The elements in the set : 19 3 37 7 22 The permutations are: { } { 3 } { 7 } { 19 } { 22 } { 37 } { 3 7 } { 3 19 } { 7 19 } { 3 22 } { 7 22 } { 19 22 } { 3 37 } { 7 37 } { 19 37 } { 22 37 } { 3 7 19 } { 3 7 22 } { 3 19 22 } { 7 19 22 } { 3 7 37 } { 3 19 37 } { 7 19 37 } { 3 22 37 } { 7 22 37 } { 19 22 37 } { 3 7 22 37 } { 3 19 22 37 } { 7 19 22 37 } { 3 7 19 37 } { 3 7 19 22 } { 3 7 19 22 37 }
Related posts:
Jackson – JsonMappingException (No serializer found for class)
So sánh ArrayList và Vector trong Java
REST Pagination in Spring
Send an email using the SMTP protocol
LIKE Queries in Spring JPA Repositories
Java Program to Find the Shortest Path Between Two Vertices Using Dijkstra’s Algorithm
Transaction Propagation and Isolation in Spring @Transactional
Guide to Spring Cloud Kubernetes
Java Program to Implement Borwein Algorithm
An Example of Load Balancing with Zuul and Eureka
Using JWT with Spring Security OAuth
Merging Two Maps with Java 8
Java Program to Implement Binary Tree
Introduction to the Functional Web Framework in Spring 5
An Intro to Spring Cloud Task
Lập trình mạng với java
Spring 5 WebClient
Java Program to Implement Circular Singly Linked List
Filtering a Stream of Optionals in Java
Spring Boot - Rest Controller Unit Test
Java Program to Solve Knapsack Problem Using Dynamic Programming
Java Program to Implement Lloyd’s Algorithm
Java Program to Convert a Decimal Number to Binary Number using Stacks
So sánh HashMap và HashSet trong Java
Spring WebClient Requests with Parameters
Java Program to Find kth Largest Element in a Sequence
Summing Numbers with Java Streams
RestTemplate Post Request with JSON
Hashtable trong java
Java Program to Check Cycle in a Graph using Topological Sort
Java Program to Check Whether a Given Point is in a Given Polygon
Java Program to Apply DFS to Perform the Topological Sorting of a Directed Acyclic Graph