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:
Supplier trong Java 8
Java Stream Filter with Lambda Expression
Removing all Nulls from a List in Java
Deploy a Spring Boot App to Azure
Java Program to implement Priority Queue
Java Program to Implement Flood Fill Algorithm
Java Program to Implement D-ary-Heap
Apache Commons Collections BidiMap
Java Program to Implement JobStateReasons API
Java Program to Perform Partial Key Search in a K-D Tree
A Guide to TreeSet in Java
Anonymous Classes in Java
Create Java Applet to Simulate Any Sorting Technique
@Order in Spring
Spring Cloud AWS – Messaging Support
Configure a RestTemplate with RestTemplateBuilder
Chương trình Java đầu tiên
Spring – Injecting Collections
Spring Cloud Series – The Gateway Pattern
Hướng dẫn Java Design Pattern – Facade
Java Program to Create the Prufer Code for a Tree
Using a List of Values in a JdbcTemplate IN Clause
Understanding Memory Leaks in Java
Spring Boot - Unit Test Cases
Overview of Spring Boot Dev Tools
Java Program to Check if a Given Binary Tree is an AVL Tree or Not
Hướng dẫn Java Design Pattern – Transfer Object
Java Program to Implement Self Balancing Binary Search Tree
Disable DNS caching
Introduction to Spring Cloud CLI
Java Program to Find the Number of Ways to Write a Number as the Sum of Numbers Smaller than Itself
Java Program to Apply Above-Below-on Test to Find the Position of a Point with respect to a Line