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:
Lớp Collectors trong Java 8
Control the Session with Spring Security
Java Program to Implement Bresenham Line Algorithm
REST Web service: Tạo ứng dụng Java RESTful Client với Jersey Client 2.x
Java Program to Construct an Expression Tree for an Prefix Expression
Java Program to Implement Gauss Jordan Elimination
Lớp Properties trong java
Constructor Dependency Injection in Spring
Spring 5 Testing with @EnabledIf Annotation
Spring RestTemplate Request/Response Logging
HashSet trong Java hoạt động như thế nào?
Spring Boot Actuator
Java Program to Implement Hash Tables Chaining with Doubly Linked Lists
Retrieve User Information in Spring Security
A Guide To UDP In Java
Java Program to Implement PriorityQueue API
Java Program to Implement Hash Tables with Linear Probing
Java Program to Implement Shell Sort
Multi Dimensional ArrayList in Java
Spring Boot - Exception Handling
Java Program to Check whether Undirected Graph is Connected using BFS
Java Program to Implement the Alexander Bogomolny’s UnOrdered Permutation Algorithm for Elements Fro...
Comparing Arrays in Java
Object cloning trong java
Giới thiệu Java Service Provider Interface (SPI) – Tạo các ứng dụng Java dễ mở rộng
Java Program to Find Nearest Neighbor for Static Data Set
Giới thiệu Google Guice – Aspect Oriented Programming (AOP)
Convert Hex to ASCII in Java
Java Program to Perform Postorder Recursive Traversal of a Given Binary Tree
Java Program to Implement WeakHashMap API
Examine the internal DNS cache
Java Program to Find Transpose of a Graph Matrix