This is a java program to generate and print all the subsets using the Gray Code Order. The reflected binary code, also known as Gray code after Frank Gray, is a binary numeral system where two successive values differ in only one bit (binary digit). The gray code equivalent of a binary number is (number >> 1) ^ number, i.e. right-shift the number by one and EX-ORing with the original number.
Here is the source code of the Java Program to Generate All Subsets of a Given Set in the Gray Code 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 subsets of given set of numbers using gray code order import java.util.Random; import java.util.Scanner; public class Gray_Code_Permutation { public static int[] grayCode(int N) { int[] grayCode = new int[(int) Math.pow(2, N)]; int[] binary = new int[(int) Math.pow(2, N)]; for (int i = 0; i < Math.pow(2, N); i++) grayCode[i] = (i >> 1) ^ i; for (int i = 0; i < Math.pow(2, N); i++) { int b = 1; binary[i] = 0; while (grayCode[i] > 0) { binary[i] += (grayCode[i] % 2) * b; grayCode[i] /= 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] + " "); int[] mask = new int[(int) Math.pow(2, N)]; mask = grayCode(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 Gray_Code_Permutation.java $ java Gray_Code_Permutation Enter the number of elements in the set: 4 The elements in the set : 36 75 15 59 The permutations are: { } { 36 } { 36 75 } { 75 } { 75 15 } { 36 75 15 } { 36 15 } { 15 } { 15 59 } { 36 15 59 } { 36 75 15 59 } { 75 15 59 } { 75 59 } { 36 75 59 } { 36 59 } { 59 } Enter the number of elements in the set: 3 The elements in the set : 73 36 36 The permutations are: { } { 73 } { 73 36 } { 36 } { 36 36 } { 73 36 36 } { 73 36 } { 36 }
Related posts:
Java Program to Compute Discrete Fourier Transform Using Naive Approach
Filtering and Transforming Collections in Guava
Automatic Property Expansion with Spring Boot
Spring Security Remember Me
Life Cycle of a Thread in Java
A Guide to JUnit 5
Java Program to Perform Deletion in a BST
OAuth 2.0 Resource Server With Spring Security 5
Java Program to Implement Trie
Spring Boot: Customize Whitelabel Error Page
LinkedHashSet trong Java hoạt động như thế nào?
Java Program to Implement Binary Heap
Quick Guide to the Java StringTokenizer
Date Time trong Java 8
Java Program to Find the Peak Element of an Array O(n) time (Naive Method)
Convert String to int or Integer in Java
Java Program to Implement the Monoalphabetic Cypher
Java Program to Find Number of Articulation points in a Graph
Spring Boot - OAuth2 with JWT
Java Program to Check Whether an Input Binary Tree is the Sub Tree of the Binary Tree
Simple Single Sign-On with Spring Security OAuth2
Java Program to find the peak element of an array using Binary Search approach
Derived Query Methods in Spring Data JPA Repositories
Xử lý ngoại lệ trong Java (Exception Handling)
Java Program to Implement Weight Balanced Tree
Implementing a Runnable vs Extending a Thread
Guide to CopyOnWriteArrayList
Sort a HashMap in Java
Xây dựng ứng dụng Client-Server với Socket trong Java
Receive email using POP3
Apache Commons Collections OrderedMap
Guide to Spring @Autowired