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:
Circular Dependencies in Spring
Guide to the Volatile Keyword in Java
Java Program to Implement HashSet API
Apache Commons Collections BidiMap
HttpClient Timeout
Quick Guide on Loading Initial Data with Spring Boot
@DynamicUpdate with Spring Data JPA
Exploring the Spring Boot TestRestTemplate
Java Program to Solve the 0-1 Knapsack Problem
A Guide to BitSet in Java
Lập trình mạng với java
Java Program to implement Sparse Vector
Java Program to Implement RenderingHints API
Constructor Injection in Spring with Lombok
Easy Ways to Write a Java InputStream to an OutputStream
Guide to Java Instrumentation
Spring Security and OpenID Connect
Java Program to Implement Network Flow Problem
Java Program to Perform Searching Using Self-Organizing Lists
Jackson vs Gson
Java Program to Perform Arithmetic Operations on Numbers of Size
The Guide to RestTemplate
Java Program to Sort an Array of 10 Elements Using Heap Sort Algorithm
Spring Data JPA @Modifying Annotation
Java Program to Check whether Graph is a Bipartite using BFS
Java Program to Implement Disjoint Sets
Hướng dẫn Java Design Pattern – Visitor
The Registration Process With Spring Security
Java Program to Generate All Possible Combinations Out of a, b, c, d, e
Logout in an OAuth Secured Application
Java Multi-line String
Spring Boot - Build Systems