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:
Quick Guide to Spring Bean Scopes
Assertions in JUnit 4 and JUnit 5
Java Program to Implement Sorted Circularly Singly Linked List
Debug a JavaMail Program
Java Program to implement Sparse Vector
ClassNotFoundException vs NoClassDefFoundError
Setting a Request Timeout for a Spring REST API
Chuyển đổi Array sang ArrayList và ngược lại
Autoboxing và Unboxing trong Java
Guide to the Volatile Keyword in Java
More Jackson Annotations
Java Program to Perform Postorder Recursive Traversal of a Given Binary Tree
Integer Constant Pool trong Java
Debug a HttpURLConnection problem
Concurrent Test Execution in Spring 5
Migrating from JUnit 4 to JUnit 5
Spring Data JPA @Query
Tạo số và chuỗi ngẫu nhiên trong Java
Java Program to Describe the Representation of Graph using Incidence Matrix
Java Program to Implement Fermat Primality Test Algorithm
Using Java Assertions
Java Program to Implement JobStateReasons API
Guide to Guava Table
Java Program to Implement Knight’s Tour Problem
Spring Boot - Apache Kafka
Java NIO2 Path API
Exploring the New Spring Cloud Gateway
Java Program to Generate All Pairs of Subsets Whose Union Make the Set
Spring @RequestMapping New Shortcut Annotations
Converting Java Date to OffsetDateTime
Request Method Not Supported (405) in Spring
Java Program to Perform Arithmetic Operations on Numbers of Size