This is a java program to perform quick sort with complexity constraint of time less than n^2.
Here is the source code of the Java Program to Implement Quick Sort with Given Complexity Constraint. The Java program is successfully compiled and run on a Windows system. The program output is also shown below.
package com.sanfoundry.combinatorial; import java.util.Random; public class QuickSortComplexityConstraint { 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 QUICK SORT with complexity less than n^2"); 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 QuickSortComplexityConstraint.java $ java QuickSortComplexityConstraint Sorting of randomly generated numbers using QUICK SORT with complexity less than n^2 Original Sequence: 29 19 67 48 23 99 72 40 23 93 0 79 70 87 43 24 56 67 51 71 Sorted Sequence: 0 19 23 23 24 29 40 43 48 51 56 67 67 70 71 72 79 87 93 99
Related posts:
Easy Ways to Write a Java InputStream to an OutputStream
Java Program to Perform Preorder Recursive Traversal of a Given Binary Tree
Java Program to Implement the One Time Pad Algorithm
Java Program to Find MST (Minimum Spanning Tree) using Prim’s Algorithm
Reading an HTTP Response Body as a String in Java
Java Program to Implement Fermat Primality Test Algorithm
Java Program to Perform Insertion in a BST
Most commonly used String methods in Java
Spring Boot Change Context Path
Deploy a Spring Boot WAR into a Tomcat Server
Java Switch Statement
Converting Java Date to OffsetDateTime
Calling Stored Procedures from Spring Data JPA Repositories
Guide to Apache Commons CircularFifoQueue
Apache Commons Collections BidiMap
Java Program to Implement ArrayList API
An Introduction to Java.util.Hashtable Class
Mix plain text and HTML content in a mail
Service Registration with Eureka
A Guide to EnumMap
Java Program to Delete a Particular Node in a Tree Without Using Recursion
Debugging Reactive Streams in Java
Guide to BufferedReader
Spring Cloud – Securing Services
Java Program to Implement Flood Fill Algorithm
Checked and Unchecked Exceptions in Java
A Guide to TreeMap in Java
XML Serialization and Deserialization with Jackson
Tạo số và chuỗi ngẫu nhiên trong Java
Merging Streams in Java
Creating a Generic Array in Java
Java Program to Find the Minimum Element of a Rotated Sorted Array using Binary Search approach