This is a java program to generate a random partitioning of a set of characters or numbers in to two sets. Randomly generate an index less than the total number of elements in the set.
Here is the source code of the Java Program to Generate Random Partition out of a Given Set of Numbers or Characters. 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 partitioning at random index and generate two sets for given set of numbers or characters import java.util.Random; import java.util.Scanner; public class Random_Partition { public static void main(String args[]) { Random random = new Random(); Scanner sc = new Scanner(System.in); int noc = random.nextInt(2); // if noc is equal to 1 generate numbers if (noc == 1) { int N = 10; int[] sequence = new int[N]; System.out.print("The Original set of numbers are:\n "); for (int i = 0; i < N; i++) { sequence[i] = Math.abs(random.nextInt(100)); System.out.print(sequence[i] + " "); } int partition_index = random.nextInt(11); System.out.println("\nThe two sequemces are: "); System.out.print("{ "); for (int i = 0; i < N; i++) { if (i == partition_index) System.out.print(" } and { "); System.out.print(sequence[i] + " "); } System.out.print("}"); System.out .println("\nPartitioning around index " + partition_index); } // else generate characters else { int N = 10; char[] sequence = new char[N]; System.out.print("The Original set of characters are:\n "); for (int i = 0; i < N; i++) { sequence[i] = (char) Math.abs(random.nextInt(123 - 97) + 97); System.out.print(sequence[i] + " "); } int partition_index = random.nextInt(11); System.out.println("\nThe two sequences are: "); System.out.print("{ "); for (int i = 0; i < N; i++) { if (i == partition_index) System.out.print(" } and { "); System.out.print(sequence[i] + " "); } System.out.print("}"); System.out .println("\nPartitioning around index " + partition_index); } sc.close(); } }
Output:
$ javac Random_Partition.java $ java Random_Partition The Original set of numbers are: 70 13 10 36 78 98 18 64 60 84 The two sequences are: { 70 13 10 36 78 98 18 64 } and { 60 84 } Partitioning around index 8 The Original set of characters are: n p r e m z y o x p The two sequences are: { n p r e m z } and { y o x p } Partitioning around index 6
Related posts:
The Difference Between map() and flatMap()
Java Program to Perform Stooge Sort
Debugging Reactive Streams in Java
The Order of Tests in JUnit
Guide to Mustache with Spring Boot
Unsatisfied Dependency in Spring
LinkedList trong java
Java Program to Generate All Subsets of a Given Set in the Gray Code Order
Redirect to Different Pages after Login with Spring Security
So sánh HashMap và Hashtable trong Java
Java Program to Perform Preorder Recursive Traversal of a Given Binary Tree
Working with Kotlin and JPA
Spring REST API + OAuth2 + Angular
Properties with Spring and Spring Boot
Java Program to Implement Quick sort
How to Add a Single Element to a Stream
Using a Custom Spring MVC’s Handler Interceptor to Manage Sessions
Hướng dẫn Java Design Pattern – Factory Method
Object cloning trong java
Serialization và Deserialization trong java
Compare Two JSON Objects with Jackson
Collect a Java Stream to an Immutable Collection
Intersection of Two Lists in Java
Logout in an OAuth Secured Application
Checking for Empty or Blank Strings in Java
Spring Cloud Bus
Java Program to Check Cycle in a Graph using Topological Sort
Java – Write an InputStream to a File
Hướng dẫn Java Design Pattern – Null Object
Creating Docker Images with Spring Boot
JWT – Token-based Authentication trong Jersey 2.x
Từ khóa this và super trong Java