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 Hamiltonian Cycle Algorithm
Java Program to Implement Find all Forward Edges in a Graph
Java Program to Implement Bresenham Line Algorithm
Thao tác với tập tin và thư mục trong Java
Java Program to Implement Max Heap
Read an Outlook MSG file
Sort a HashMap in Java
Java Program to Implement PriorityBlockingQueue API
Spring Boot - Eureka Server
Java 8 – Powerful Comparison with Lambdas
Converting Between an Array and a Set in Java
Java Program to Implement Euler Circuit Problem
Daemon Threads in Java
Check If a String Is Numeric in Java
Reactive Flow with MongoDB, Kotlin, and Spring WebFlux
A Guide to the Java LinkedList
REST Web service: Upload và Download file với Jersey 2.x
Spring Boot - Scheduling
Spring Boot - Build Systems
Working with Kotlin and JPA
Java – Reader to InputStream
New Features in Java 12
Spring Cloud AWS – EC2
Error Handling for REST with Spring
Supplier trong Java 8
Java – Random Long, Float, Integer and Double
Map to String Conversion in Java
Ignore Null Fields with Jackson
Reactive WebSockets with Spring 5
Introduction to Netflix Archaius with Spring Cloud
Giới thiệu SOAP UI và thực hiện test Web Service
Interface trong Java 8 – Default method và Static method