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:
Java Program to Find the Minimum value of Binary Search Tree
Spring @Primary Annotation
Dockerizing a Spring Boot Application
Lập trình đa luồng trong Java (Java Multi-threading)
Spring Cloud – Tracing Services with Zipkin
Case-Insensitive String Matching in Java
REST Web service: Tạo ứng dụng Java RESTful Client với Jersey Client 2.x
Encode a String to UTF-8 in Java
Derived Query Methods in Spring Data JPA Repositories
Java Program to Implement Ternary Heap
Spring Cloud – Adding Angular
Jackson Ignore Properties on Marshalling
Java Program to Implement Pollard Rho Algorithm
Java Program to Implement CopyOnWriteArrayList API
Constructor Injection in Spring with Lombok
Java Program to Generate Randomized Sequence of Given Range of Numbers
Java Program to Check whether Undirected Graph is Connected using DFS
Quick Guide to the Java StringTokenizer
wait() and notify() Methods in Java
Java Program to implement Bi Directional Map
Java Program to implement Priority Queue
Using a Custom Spring MVC’s Handler Interceptor to Manage Sessions
Java Program to Implement Gale Shapley Algorithm
Java Program to Generate Random Numbers Using Middle Square Method
Java Program to Create a Minimal Set of All Edges Whose Addition will Convert it to a Strongly Conne...
Read an Outlook MSG file
Java Program to Implement Hash Trie
Inheritance with Jackson
Spring Security Basic Authentication
Spring Boot - Apache Kafka
Spring Boot - Admin Client
Jackson JSON Views