This is a java program to implement Shell Sort Algorithm.
Here is the source code of the Java Program to Implement Shell Sort. The Java program is successfully compiled and run on a Windows system. The program output is also shown below.
//This is a program to sort numbers using Shell Sort import java.util.Random; public class Shell_Sort { public static int N = 20; public static int[] sequence = new int[N]; public static void shellSort() { int increment = sequence.length / 2; while (increment > 0) { for (int i = increment; i < sequence.length; i++) { int j = i; int temp = sequence[i]; while (j >= increment && sequence[j - increment] > temp) { sequence[j] = sequence[j - increment]; j = j - increment; } sequence[j] = temp; } if (increment == 2) increment = 1; else increment *= (5.0 / 11); } } 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 SHELL 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: "); shellSort(); printSequence(sequence); } }
Output:
$ javac Shell_Sort.java $ java Shell_Sort Sorting of randomly generated numbers using BUBBLE SORT Original Sequence: 67 57 55 13 83 80 29 89 30 46 68 71 6 12 5 3 68 8 18 6 Sorted Sequence: 3 5 6 6 8 12 13 18 29 30 46 55 57 67 68 68 71 80 83 89
Related posts:
Java Program to Implement Singly Linked List
Guide to ThreadLocalRandom in Java
Java Program to Implement Circular Singly Linked List
Bootstrapping Hibernate 5 with Spring
Spring JDBC
Java Program to do a Breadth First Search/Traversal on a graph non-recursively
A Guide to TreeSet in Java
How to Read a File in Java
A Guide to BitSet in Java
Java Program to Implement Binary Search Tree
Java Program to Implement PrinterStateReasons API
Java Program to Solve any Linear Equation in One Variable
Java Program to Check the Connectivity of Graph Using BFS
HandlerAdapters in Spring MVC
Java Program to Check whether Graph is Biconnected
Using the Map.Entry Java Class
Custom JUnit 4 Test Runners
Java Program to Implement Fisher-Yates Algorithm for Array Shuffling
Java Program to Find Minimum Number of Edges to Cut to make the Graph Disconnected
Using Optional with Jackson
Java Program to Implement Strassen Algorithm
Convert Hex to ASCII in Java
Java Program to Implement Stein GCD Algorithm
Spring Boot - Introduction
Java Program to Check Whether Topological Sorting can be Performed in a Graph
Converting String to Stream of chars
Spring Boot - Database Handling
Using a Mutex Object in Java
Guide to DelayQueue
Java Program to Perform Searching Using Self-Organizing Lists
Tạo ứng dụng Java RESTful Client với thư viện Retrofit
Java Program to Implement D-ary-Heap