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:
Compare Two JSON Objects with Jackson
Giới thiệu Json Web Token (JWT)
Java Program to Check if it is a Sparse Matrix
Java Program to Search Number Using Divide and Conquer with the Aid of Fibonacci Numbers
Converting Between an Array and a Set in Java
Using Optional with Jackson
Working With Maps Using Streams
String Joiner trong Java 8
Java Program to Check whether Graph is a Bipartite using BFS
Spring MVC Async vs Spring WebFlux
Java Program to Perform Searching Using Self-Organizing Lists
Comparing Two HashMaps in Java
Send an email using the SMTP protocol
Spring Boot - Tomcat Port Number
Hướng dẫn Java Design Pattern – DAO
Java Program to Implement Quick Hull Algorithm to Find Convex Hull
Deploy a Spring Boot App to Azure
Registration – Activate a New Account by Email
Hướng dẫn sử dụng Java Annotation
Java Program to Describe the Representation of Graph using Incidence List
A Guide to LinkedHashMap in Java
Spring – Injecting Collections
Guide to Selenium with JUnit / TestNG
Convert XML to JSON Using Jackson
Rate Limiting in Spring Cloud Netflix Zuul
Java Program to Implement Multi-Threaded Version of Binary Search Tree
Java Program to Implement Sorted Circular Doubly Linked List
Introduction to Spring Cloud Stream
A Guide to Iterator in Java
Java Program to Implement AttributeList API
Java Program to Implement Hash Trie
Array to String Conversions