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:
Spring Cloud – Adding Angular
Java Program to Find the Shortest Path from Source Vertex to All Other Vertices in Linear Time
Serverless Functions with Spring Cloud Function
Spring Security Basic Authentication
@Before vs @BeforeClass vs @BeforeEach vs @BeforeAll
Java Program to Solve Knapsack Problem Using Dynamic Programming
Java Program to Implement Bellman-Ford Algorithm
Java Program to Implement Knight’s Tour Problem
Java Program to Implement Repeated Squaring Algorithm
Java Program to Implement ScapeGoat Tree
Guide to Escaping Characters in Java RegExps
Java Program to Describe the Representation of Graph using Adjacency Matrix
Custom JUnit 4 Test Runners
Spring Boot Integration Testing with Embedded MongoDB
A Guide to JPA with Spring
Remove the First Element from a List
Spring Security Login Page with React
Hướng dẫn Java Design Pattern – Mediator
Split a String in Java
Custom Error Pages with Spring MVC
Java Program to Perform Postorder Recursive Traversal of a Given Binary Tree
Spring Boot With H2 Database
A Guide to WatchService in Java NIO2
Returning Image/Media Data with Spring MVC
Immutable Map Implementations in Java
Convert Time to Milliseconds in Java
Java Collections Interview Questions
Merging Two Maps with Java 8
Java Program to Implement First Fit Decreasing for 1-D Objects and M Bins
Spring Security Remember Me
Java Program to Check whether Undirected Graph is Connected using DFS
Java Program to Implement Bresenham Line Algorithm