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 Sorted Singly Linked List
REST Web service: Basic Authentication trong Jersey 2.x
Servlet 3 Async Support with Spring MVC and Spring Security
Java Program to Implement Gauss Seidel Method
Giới thiệu Design Patterns
How to Define a Spring Boot Filter?
Concatenating Strings In Java
Get the workstation name or IP
Java Program to Implement Patricia Trie
Guide to the ConcurrentSkipListMap
Java Program to Implement Strassen Algorithm
Java Program to Generate All Possible Combinations of a Given List of Numbers
Java Program to Find k Numbers Closest to Median of S, Where S is a Set of n Numbers
Các chương trình minh họa sử dụng Cấu trúc điều khiển trong Java
Reading an HTTP Response Body as a String in Java
Extract network card address
Difference Between Wait and Sleep in Java
Generating Random Dates in Java
Giới thiệu Google Guice – Aspect Oriented Programming (AOP)
Hướng dẫn Java Design Pattern – Facade
Java Program to Implement the Checksum Method for Small String Messages and Detect
Quản lý bộ nhớ trong Java với Heap Space vs Stack
OAuth2 for a Spring REST API – Handle the Refresh Token in Angular
Multipart Upload with HttpClient 4
Java Program to Implement Stein GCD Algorithm
Most commonly used String methods in Java
Java Program to Implement LinkedHashMap API
Java Program to Check if it is a Sparse Matrix
Split a String in Java
Java Program to Implement Suffix Array
Testing an OAuth Secured API with Spring MVC
Spring @RequestMapping New Shortcut Annotations