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:
Filtering and Transforming Collections in Guava
Java String to InputStream
Spring Data Reactive Repositories with MongoDB
Lập trình đa luồng với Callable và Future trong Java
StringBuilder vs StringBuffer in Java
Java Program to Find Hamiltonian Cycle in an UnWeighted Graph
Upload and Display Excel Files with Spring MVC
Spring Boot - Batch Service
Kết hợp Java Reflection và Java Annotations
Java Program to Implement LinkedHashMap API
Java Program to Perform LU Decomposition of any Matrix
A Quick JUnit vs TestNG Comparison
Introduction to Spring MVC HandlerInterceptor
Lập trình đa luồng trong Java (Java Multi-threading)
Spring Security 5 for Reactive Applications
Java Program to Implement Ternary Tree
Map Interface trong java
Java – Get Random Item/Element From a List
Java Program to Check Multiplicability of Two Matrices
Case-Insensitive String Matching in Java
Java Program to Implement Stack using Two Queues
Java Program to Implement Sorted Vector
Java Program to Implement Triply Linked List
Java Map With Case-Insensitive Keys
Java Program to Implement Double Ended Queue
Java Copy Constructor
Server-Sent Events in Spring
Java Program to Solve the 0-1 Knapsack Problem
Check If Two Lists are Equal in Java
Spring Security with Maven
Java Program to Implement Rope
Một số từ khóa trong Java