This is a java program to perform sorting using Randomized Quick Sort. Randomized Quick Sort randomly selects a pivot element, after selecting pivot standard procedure is to be followed as quick sort.
Here is the source code of the Java Program to Implement Quick Sort Using Randomization. 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 sort numbers using randomized quick sort import java.util.Random; public class Randomized_Quick_Sort { public static int N = 20; public static int[] sequence = new int[N]; public static void QuickSort(int left, int right) { if (right - left <= 0) return; else { Random rand = new Random(); int pivotIndex = left + rand.nextInt(right - left + 1); swap(pivotIndex, right); int pivot = sequence[right]; int partition = partitionIt(left, right, pivot); QuickSort(left, partition - 1); QuickSort(partition + 1, right); } } public static int partitionIt(int left, int right, long pivot) { int leftPtr = left - 1; int rightPtr = right; while (true) { while (sequence[++leftPtr] < pivot) ; while (rightPtr > 0 && sequence[--rightPtr] > pivot) ; if (leftPtr >= rightPtr) break; else swap(leftPtr, rightPtr); } swap(leftPtr, right); return leftPtr; } public static void swap(int dex1, int dex2) { int temp = sequence[dex1]; sequence[dex1] = sequence[dex2]; sequence[dex2] = temp; } static void printSequence(int[] sorted_sequence) { for (int i = 0; i < sorted_sequence.length; i++) System.out.print(sorted_sequence[i] + " "); } public static void main(String args[]) { System.out .println("Sorting of randomly generated numbers using RANDOMIZED QUICK SORT"); Random random = new Random(); for (int i = 0; i < N; i++) sequence[i] = Math.abs(random.nextInt(100)); System.out.println("\nOriginal Sequence: "); printSequence(sequence); System.out.println("\nSorted Sequence: "); QuickSort(0, N - 1); printSequence(sequence); } }
Output:
$ javac Randomized_Quick_Sort.java $ java Randomized_Quick_Sort Sorting of randomly generated numbers using RANDOMIZED QUICK SORT Original Sequence: 98 95 22 64 77 49 11 98 56 63 84 18 9 68 4 69 2 20 68 4 Sorted Sequence: 2 4 4 9 11 18 20 22 49 56 63 64 68 68 69 77 84 95 98 98
Related posts:
Hướng dẫn Java Design Pattern – Adapter
Ép kiểu trong Java (Type casting)
ThreadPoolTaskExecutor corePoolSize vs. maxPoolSize
Java – Convert File to InputStream
Spring MVC Custom Validation
Sử dụng JDBC API thực thi câu lệnh truy vấn dữ liệu
Java Program to Perform Cryptography Using Transposition Technique
Custom Thread Pools In Java 8 Parallel Streams
Interface trong Java 8 – Default method và Static method
Java Program to Implement CopyOnWriteArraySet API
Spring Boot - Introduction
Configuring a DataSource Programmatically in Spring Boot
Spring Boot - Twilio
Hướng dẫn Java Design Pattern – Abstract Factory
Intro to Spring Boot Starters
HashSet trong Java hoạt động như thế nào?
Calling Stored Procedures from Spring Data JPA Repositories
Java Program to Implement Hash Tables Chaining with Binary Trees
OAuth2 Remember Me with Refresh Token
Convert XML to JSON Using Jackson
Java Program to Implement AVL Tree
Logging in Spring Boot
Documenting a Spring REST API Using OpenAPI 3.0
Java Program to Check for balanced parenthesis by using Stacks
Hashtable trong java
A Quick Guide to Spring Cloud Consul
How to Get All Dates Between Two Dates?
HashMap trong Java hoạt động như thế nào?
Java Program to Implement ConcurrentHashMap API
Introduction to Spring Data JPA
Using Spring ResponseEntity to Manipulate the HTTP Response
Java Program to subtract two large numbers using Linked Lists