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 Perform integer Partition for a Specific Case
Luồng Daemon (Daemon Thread) trong Java
A Quick Guide to Spring MVC Matrix Variables
Spring’s RequestBody and ResponseBody Annotations
Từ khóa static và final trong java
The Difference Between map() and flatMap()
Java Program to Check Whether Topological Sorting can be Performed in a Graph
Compact Strings in Java 9
The Spring @Controller and @RestController Annotations
Java Program to Implement Randomized Binary Search Tree
Java Program to Perform Preorder Recursive Traversal of a Given Binary Tree
Logging in Spring Boot
Spring 5 Functional Bean Registration
A Guide to Spring Boot Admin
Introduction to Using FreeMarker in Spring MVC
Java Program to Implement the Hill Cypher
Java Program to Implement Fenwick Tree
Mệnh đề if-else trong java
Java Program to Implement Heap Sort Using Library Functions
RestTemplate Post Request with JSON
Java Program to Implement Shell Sort
The Spring @Controller and @RestController Annotations
Database Migrations with Flyway
How to Read a Large File Efficiently with Java
The DAO with JPA and Spring
HashMap trong Java hoạt động như thế nào?
Java Program to Perform Insertion in a BST
Changing Annotation Parameters At Runtime
Java Program to Implement Hopcroft Algorithm
Introduction to Project Reactor Bus
Java Program to Find kth Smallest Element by the Method of Partitioning the Array
Introduction to the Java NIO2 File API