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:
Collect a Java Stream to an Immutable Collection
Java Program to Implement the Binary Counting Method to Generate Subsets of a Set
Java Program to Perform Arithmetic Operations on Numbers of Size
How to Manually Authenticate User with Spring Security
Spring Web Annotations
Spring Boot - Tomcat Port Number
Spring Boot - Creating Docker Image
Giới thiệu Aspect Oriented Programming (AOP)
Java Program to Compute Discrete Fourier Transform Using Naive Approach
Map Interface trong java
Lớp TreeMap trong Java
Control the Session with Spring Security
Check if a String is a Palindrome in Java
Java Program to Test Using DFS Whether a Directed Graph is Weakly Connected or Not
How to Use if/else Logic in Java 8 Streams
Hướng dẫn sử dụng luồng vào ra nhị phân trong Java
Limiting Query Results with JPA and Spring Data JPA
Form Validation with AngularJS and Spring MVC
Spring Security Basic Authentication
Java Program to Sort an Array of 10 Elements Using Heap Sort Algorithm
Concatenating Strings In Java
Hướng dẫn Java Design Pattern – Singleton
How to Replace Many if Statements in Java
Java Program to Implement Sorted Circular Doubly Linked List
Custom Error Pages with Spring MVC
Spring @Primary Annotation
Java Program to Perform Searching in a 2-Dimension K-D Tree
Java Switch Statement
Java Program to Search for an Element in a Binary Search Tree
Assertions in JUnit 4 and JUnit 5
Mapping a Dynamic JSON Object with Jackson
Java Program to Implement wheel Sieve to Generate Prime Numbers Between Given Range