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:
Introduction to Netflix Archaius with Spring Cloud
Introduction to Spring Cloud Rest Client with Netflix Ribbon
Stack Memory and Heap Space in Java
Disable Spring Data Auto Configuration
Autoboxing và Unboxing trong Java
Spring NoSuchBeanDefinitionException
Apache Commons Collections OrderedMap
Java Program to Create a Balanced Binary Tree of the Incoming Data
Spring Boot Annotations
Simple Single Sign-On with Spring Security OAuth2
Using the Map.Entry Java Class
Check if there is mail waiting
Hướng dẫn sử dụng Printing Service trong Java
Java Program to Implement Radix Sort
HTTP Authentification and CGI/Servlet
Java Program to Solve Tower of Hanoi Problem using Stacks
Spring Boot With H2 Database
Life Cycle of a Thread in Java
Spring Data JPA Delete and Relationships
Java Program to Delete a Particular Node in a Tree Without Using Recursion
Send an email using the SMTP protocol
Rate Limiting in Spring Cloud Netflix Zuul
A Guide to @RepeatedTest in Junit 5
Validations for Enum Types
The HttpMediaTypeNotAcceptableException in Spring MVC
Spring Data JPA and Null Parameters
Introduction to Spring Cloud Netflix – Eureka
Introduction to Spring Data MongoDB
Java Program to Find the Nearest Neighbor Using K-D Tree Search
Java – Rename or Move a File
Exploring the Spring Boot TestRestTemplate
Receive email by java client