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:
Versioning a REST API
OAuth2 for a Spring REST API – Handle the Refresh Token in Angular
Guide to the Synchronized Keyword in Java
Java – Create a File
Removing all Nulls from a List in Java
Java Program to implement Priority Queue
Java Program to Implement Gift Wrapping Algorithm in Two Dimensions
Basic Authentication with the RestTemplate
Java Program to Implement Dijkstra’s Algorithm using Set
A Guide to JUnit 5
Java Program to Generate All Subsets of a Given Set in the Lexico Graphic Order
Tránh lỗi ConcurrentModificationException trong Java như thế nào?
Java Program to Implement Disjoint Sets
Java Program to Implement Rolling Hash
Remove All Occurrences of a Specific Value from a List
Jackson – Change Name of Field
Java InputStream to String
So sánh ArrayList và Vector trong Java
Java Program to Construct an Expression Tree for an Prefix Expression
Control the Session with Spring Security
Spring REST with a Zuul Proxy
Spring Security with Maven
A Guide to JUnit 5 Extensions
A Custom Media Type for a Spring REST API
Using the Map.Entry Java Class
Java Program to Represent Graph Using 2D Arrays
Spring Webflux with Kotlin
Hướng dẫn sử dụng biểu thức chính quy (Regular Expression) trong Java
Java Program to Compute the Area of a Triangle Using Determinants
Reading an HTTP Response Body as a String in Java
So sánh HashMap và HashSet trong Java
Java Program to Generate All Possible Subsets with Exactly k Elements in Each Subset