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 Implement the String Search Algorithm for Short Text Sizes
Java Program to implement Sparse Vector
Primitive Type Streams in Java 8
Java Program to add two large numbers using Linked List
Apache Camel with Spring Boot
Java Program to Implement Disjoint Set Data Structure
Encode/Decode to/from Base64
Java – Create a File
OAuth2 for a Spring REST API – Handle the Refresh Token in Angular
JUnit 5 for Kotlin Developers
HttpAsyncClient Tutorial
Java Program to Compute Discrete Fourier Transform Using Naive Approach
Java Program to Implement Min Heap
Java Program to Implement HashSet API
Java Program to Implement Max-Flow Min-Cut Theorem
An Introduction to ThreadLocal in Java
An Intro to Spring Cloud Contract
The Guide to RestTemplate
Java Program to Find Inverse of a Matrix
Hướng dẫn Java Design Pattern – Flyweight
Introduction to Spliterator in Java
Overflow and Underflow in Java
New in Spring Security OAuth2 – Verify Claims
Java Program to Implement Knapsack Algorithm
Java Program to Perform Inorder Recursive Traversal of a Given Binary Tree
A Guide to TreeMap in Java
Java Program to Implement Solovay Strassen Primality Test Algorithm
Java Program to implement Bit Matrix
Java Program to Find the Vertex Connectivity of a Graph
The SpringJUnitConfig and SpringJUnitWebConfig Annotations in Spring 5
Truyền giá trị và tham chiếu trong java
Remove HTML tags from a file to extract only the TEXT