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 kartik Follow Improve Article Tags : Sorting Java Programs DSA BubbleSort Practice Tags : Sorting Similar Reads DSA Tutorial - Learn Data Structures and Algorithms DSA (Data Structures and Algorithms) is the study of organizing data efficiently using data structures like arrays, stacks, and trees, paired with step-by-step procedures (or algorithms) to solve problems effectively. Data structures manage how data is stored and accessed, while algorithms focus on 7 min read Quick Sort QuickSort is a sorting algorithm based on the Divide and Conquer that picks an element as a pivot and partitions the given array around the picked pivot by placing the pivot in its correct position in the sorted array. It works on the principle of divide and conquer, breaking down the problem into s 12 min read Merge Sort - Data Structure and Algorithms Tutorials Merge sort is a popular sorting algorithm known for its efficiency and stability. It follows the divide-and-conquer approach. It works by recursively dividing the input array into two halves, recursively sorting the two halves and finally merging them back together to obtain the sorted array. Merge 14 min read Bubble Sort Algorithm Bubble Sort is the simplest sorting algorithm that works by repeatedly swapping the adjacent elements if they are in the wrong order. This algorithm is not suitable for large data sets as its average and worst-case time complexity are quite high.We sort the array using multiple passes. After the fir 8 min read Data Structures Tutorial Data structures are the fundamental building blocks of computer programming. They define how data is organized, stored, and manipulated within a program. Understanding data structures is very important for developing efficient and effective algorithms. What is Data Structure?A data structure is a st 2 min read Breadth First Search or BFS for a Graph Given a undirected graph represented by an adjacency list adj, where each adj[i] represents the list of vertices connected to vertex i. Perform a Breadth First Search (BFS) traversal starting from vertex 0, visiting vertices from left to right according to the adjacency list, and return a list conta 15+ min read Binary Search Algorithm - Iterative and Recursive Implementation Binary Search Algorithm is a searching algorithm used in a sorted array by repeatedly dividing the search interval in half. The idea of binary search is to use the information that the array is sorted and reduce the time complexity to O(log N). Binary Search AlgorithmConditions to apply Binary Searc 15 min read Insertion Sort Algorithm Insertion sort is a simple sorting algorithm that works by iteratively inserting each element of an unsorted list into its correct position in a sorted portion of the list. It is like sorting playing cards in your hands. You split the cards into two groups: the sorted cards and the unsorted cards. T 9 min read Dijkstra's Algorithm to find Shortest Paths from a Source to all Given a weighted undirected graph represented as an edge list and a source vertex src, find the shortest path distances from the source vertex to all other vertices in the graph. The graph contains V vertices, numbered from 0 to V - 1.Note: The given graph does not contain any negative edge. Example 12 min read Selection Sort Selection Sort is a comparison-based sorting algorithm. It sorts an array by repeatedly selecting the smallest (or largest) element from the unsorted portion and swapping it with the first unsorted element. This process continues until the entire array is sorted.First we find the smallest element an 8 min read Like