Java Program for Bubble Sort Last Updated : 22 Oct, 2024 Comments Improve Suggest changes Like Article Like Report Bubble Sort is the simplest sorting algorithm that works by repeatedly swapping the adjacent elements if they are in the wrong order. Bubble Sort in Java is not the best method to sort an array but is one of the most basic implementations for one to learn. In this article, we will learn how to write a program for Bubble Sort in Java.Please refer complete article on Bubble Sort for more details! Algorithm for Bubble Sort in JavaThe following is the algorithm to sort array in increasing order using bubble sort in Java:StartInitiate two values n as size of array ,also i and j to traverse array.Put i=0 and j=1.While traversing if array[i] > array[j] swap both the numbers.Increment the value i and j then goto Step 3.If the value of i > n-1 and j > n and n>1 thenn=n-1goto Step 2ExitProgram for Bubble Sort in JavaBelow is the Program implementing Bubble Sort in Java Java // Java program for implementation // of Bubble Sort class BubbleSort { void bubbleSort(int arr[]) { int n = arr.length; for (int i = 0; i < n - 1; i++) for (int j = 0; j < n - i - 1; j++) if (arr[j] > arr[j + 1]) { // swap temp and arr[i] int temp = arr[j]; arr[j] = arr[j + 1]; arr[j + 1] = temp; } } // Driver method to test above public static void main(String args[]) { BubbleSort ob = new BubbleSort(); int a[] = { 64, 34, 25, 12 }; ob.bubbleSort(a); int n = a.length; for (int i = 0; i < n; ++i) System.out.print(a[i] + " "); System.out.println(); } } Output12 25 34 64 Complexity Analysis of Java Bubble SortTime Complexity: O(n2)Auxiliary Space: O(1)Advantage of Bubble Sort in JavaDespite Bubble Sort Being a bit slow it has certain advantages too as mentioned below:Easy to implement and understand.The space Complexity of the algorithm is O(1) as no extra memory is required.It is a stable sorting algorithm, meaning that elements with the same key value maintain their relative order in the sorted output.Reference ArticlesPlease refer complete article on Bubble Sort for more details! Comment More infoAdvertise with us Next Article Java Program for Bubble Sort K kartik Follow Improve Article Tags : Sorting Java Programs DSA BubbleSort Practice Tags : Sorting Similar Reads Java Program for Recursive Bubble Sort Background :Bubble Sort is the simplest sorting algorithm that works by repeatedly swapping the adjacent elements if they are in wrong order.Following is iterative Bubble sort algorithm : // Iterative Bubble Sort bubbleSort(arr[], n) { for (i = 0; i < n-1; i++) // Last i elements are already in p 2 min read Java Program for Comb Sort Comb Sort is mainly an improvement over Bubble Sort. Bubble sort always compares adjacent values. So all inversions are removed one by one. Comb Sort improves on Bubble Sort by using gap of size more than 1. The gap starts with a large value and shrinks by a factor of 1.3 in every iteration until it 2 min read Java Program for Counting Sort Counting sort is a sorting technique based on keys between a specific range. It works by counting the number of objects having distinct key values (kind of hashing). Then doing some arithmetic to calculate the position of each object in the output sequence. Java // Java implementation of Counting So 2 min read Java Program for QuickSort Like Merge Sort, QuickSort is a Divide and Conquer algorithm. It picks an element as pivot and partitions the given array around the picked pivot. There are many different versions of QuickSort that pick pivot in different ways.Always pick first element as pivot.Always pick last element as pivot (im 2 min read Java Program for ShellSort In shellSort, we make the array h-sorted for a large value of h. We keep reducing the value of h until it becomes 1. An array is said to be h-sorted if all sublists of every h'th element is sorted. Java // Java implementation of ShellSort class ShellSort { /* An utility function to print array of si 2 min read Like