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:
Java Program to Implement the Schonhage-Strassen Algorithm for Multiplication of Two Numbers
Java Program to find the maximum subarray sum using Binary Search approach
Introduction to Spring Method Security
Hướng dẫn sử dụng Java Reflection
Call Methods at Runtime Using Java Reflection
Spring Boot - Quick Start
Java Program to Implement Regular Falsi Algorithm
Remove the First Element from a List
Debugging Reactive Streams in Java
Rest Web service: Filter và Interceptor với Jersey 2.x (P2)
Zipping Collections in Java
A Guide to System.exit()
Java Program to Solve the Fractional Knapsack Problem
How to Count Duplicate Elements in Arraylist
Java Program to Perform Left Rotation on a Binary Search Tree
Java Program to Find the Peak Element of an Array O(n) time (Naive Method)
Derived Query Methods in Spring Data JPA Repositories
Java Program to Represent Graph Using 2D Arrays
Guide to the Java TransferQueue
Hướng dẫn Java Design Pattern – Null Object
Java Concurrency Interview Questions and Answers
Java Program to Implement Pagoda
Java Program to Implement Direct Addressing Tables
Java Program to Generate All Pairs of Subsets Whose Union Make the Set
Tránh lỗi ConcurrentModificationException trong Java như thế nào?
Weak References in Java
Giới thiệu Json Web Token (JWT)
Java Program to Implement Double Ended Queue
Java Program to Implement Gaussian Elimination Algorithm
Chương trình Java đầu tiên
New Features in Java 10
Apache Camel with Spring Boot