Sorting Algorithms in Java

Java Programming Examples - Sorting

Sorting algorithms are used to rearrange the elements of an array or list in a specific order. The efficiency of any sorting algorithm is determined by the algorithm’s time and space complexity. A sorting algorithm is said to be stable if two or more items with the same value retain their relative positions after sorting. Some of the most common sorting algorithms are Selection Sort, Bubble Sort, Insertion Sort, Merge Sort, Quick Sort, Bucket Sort, Heap Sort, Radix Sort, and Counting Sort algorithms.

The following section contains various programs on Java sorting algorithms. Each sample program includes a program description, Java code, and program output. All examples have been compiled and tested on Windows and Linux systems.

advertisement

Here is the listing of Java Programming Examples on Sorting:

  1. Sorting Algorithms in Java
  2. Java Programs on Quick Sort
  3. Java Programs on Heap Sort
  4. Java Programs on Sorting

1. Sorting Algorithms in Java

Program Description
Insertion Sort in Java Java Program to Implement Insertion Sort
Selection Sort in Java Java Program to Implement Selection Sort
Bubble Sort in Java Java Program to Implement Bubble Sort
Merge Sort in Java Java Program to Implement Merge Sort
Shell Sort Algorithm in Java Java Program to Implement Shell Sort Algorithm
Radix Sort in Java Java Program to Implement Radix Sort
Counting Sort in Java Java Program to Implement Counting Sort
Bucket Sort in Java Java Program to Implement Bucket Sort
Stooge Sort Algorithm in Java Java Program to Perform Stooge Sort Algorithm
Shaker Sort in Java Java Program to Implement Shaker Sort
Merge Sort Algorithm on Linked List in Java Java Program to Sort Linked List using Merge Sort
Sorting using Counting Sort in Java Java Program to Perform the Sorting Using Counting Sort

advertisement
advertisement

2. Java Programs on Quick Sort

Program Description
Quick sort in Java Java Program to Implement Quick sort
Quick Sort using Randomization in Java Java Program to Implement Quick Sort Using Randomization
Quick Sort on Large Number of Elements in Java Java Program to Perform Quick Sort on Large Number of Elements
Quick Sort with Complexity Constraint in Java Java Program to Implement Quick Sort with Given Complexity Constraint

3. Java Programs on Heap Sort

Program Description
Heap sort in Java Java Program to Implement Heap sort
Sort Array Elements using Heap Sort in Java Java Program to Sort Array Elements using Heap Sort
Sort 10 Elements using Heap Sort Algorithm in Java Java Program to Sort 10 Elements using Heap Sort Algorithm

4. Java Programs on Sorting

Program Description
Sort the Array in Ascending Order in Java Java Program to Sort an Array in Ascending Order
Sort the Array in Descending Order in Java Java Program to Sort an Array in Descending Order
Sort Names in Alphabetical Order in Java Java Program to Sort N Names in an Alphabetical Order
Sorting using B Tree in Java Java Program to Perform Sorting using B-Tree
Sorting Numbers in O(n) Complexity in Java Java Program to Implement Sorting of Less than 100 Numbers in O(n) Complexity
Majority Element in an Array in Java Java Program to Find Majority Element in a Sorted Array

advertisement
Manish Bhojasia - Founder & CTO at Sanfoundry
Manish Bhojasia, a technology veteran with 20+ years @ Cisco & Wipro, is Founder and CTO at Sanfoundry. He lives in Bangalore, and focuses on development of Linux Kernel, SAN Technologies, Advanced C, Data Structures & Alogrithms. Stay connected with him at LinkedIn.

Subscribe to his free Masterclasses at Youtube & technical discussions at Telegram SanfoundryClasses.