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:
Immutable Objects in Java
Annotation trong Java 8
Guide To CompletableFuture
Sử dụng JDBC API thực thi câu lệnh truy vấn dữ liệu
Java Program to Check the Connectivity of Graph Using BFS
What is a POJO Class?
Introduction to Netflix Archaius with Spring Cloud
Hướng dẫn Java Design Pattern – Proxy
How to Replace Many if Statements in Java
Quick Guide on Loading Initial Data with Spring Boot
Introduction to Spring Cloud OpenFeign
Spring Data MongoDB – Indexes, Annotations and Converters
How to Set TLS Version in Apache HttpClient
Split a String in Java
Limiting Query Results with JPA and Spring Data JPA
Quick Guide to Spring Bean Scopes
Lập trình đa luồng với CompletableFuture trong Java 8
Hướng dẫn sử dụng Java Reflection
Automatic Property Expansion with Spring Boot
Java Program to Implement Dijkstra’s Algorithm using Priority Queue
Introduction to Spring Cloud Stream
Hướng dẫn Java Design Pattern – Builder
Registration – Password Strength and Rules
Java Program to Repeatedly Search the Same Text (such as Bible by building a Data Structure)
Java CyclicBarrier vs CountDownLatch
Comparing Long Values in Java
More Jackson Annotations
Interface trong Java 8 – Default method và Static method
Java Program to Implement Bucket Sort
Spring Data Java 8 Support
Java Program to Implement Flood Fill Algorithm
Spring Boot - Twilio