This is a java program to sort the numbers using the Bubble Sort Technique. The algorithm goes with the name, generally used to sort numbers in the ascending order. The smallest numbers bubbles up at each iteration of the sort. The time complexity of the algorithm is O(n^2).
Here is the source code of the Java Program to Implement Bubble Sort. The Java program is successfully compiled and run on a Windows system. The program output is also shown below.
//This is a java program to sort numbers using bubble sort import java.util.Random; public class Bubble_Sort { static int[] sort(int[] sequence) { // Bubble Sort for (int i = 0; i < sequence.length; i++) for (int j = 0; j < sequence.length - 1; j++) if (sequence[j] > sequence[j + 1]) { sequence[j] = sequence[j] + sequence[j + 1]; sequence[j + 1] = sequence[j] - sequence[j + 1]; sequence[j] = sequence[j] - sequence[j + 1]; } return sequence; } 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 BUBBLE SORT"); Random random = new Random(); int N = 20; int[] sequence = new int[N]; for (int i = 0; i < N; i++) sequence[i] = Math.abs(random.nextInt(1000)); System.out.println("\nOriginal Sequence: "); printSequence(sequence); System.out.println("\nSorted Sequence: "); printSequence(sort(sequence)); } }
Output:
$ javac Binary_Counting_Subsets.java $ java Binary_Counting_Subsets $ javac Bubble_Sort.java $ java Bubble_Sort Sorting of randomly generated numbers using BUBBLE SORT Original Sequence: 307 677 574 88 325 851 676 357 172 932 166 450 60 538 964 987 706 690 919 518 Sorted Sequence: 60 88 166 172 307 325 357 450 518 538 574 676 677 690 706 851 919 932 964 987
Related posts:
Thao tác với tập tin và thư mục trong Java
Java Program to Implement Binomial Heap
Debug a JavaMail Program
Java Program to Implement Insertion Sort
Java Program to Perform Arithmetic Operations on Numbers of Size
Java Program to Implement Euclid GCD Algorithm
Guide to the Fork/Join Framework in Java
Quick Guide to Spring MVC with Velocity
Spring Boot - Enabling Swagger2
Java Byte Array to InputStream
Java Program to Find MST (Minimum Spanning Tree) using Prim’s Algorithm
Spring Boot - Unit Test Cases
Map Interface trong java
Spring Boot - Quick Start
“Stream has already been operated upon or closed” Exception in Java
Reading an HTTP Response Body as a String in Java
Spring Boot - Hystrix
Introduction to Spring Security Expressions
Debugging Reactive Streams in Java
DynamoDB in a Spring Boot Application Using Spring Data
Spring’s RequestBody and ResponseBody Annotations
Spring Boot - Tracing Micro Service Logs
Java Program to implement Bit Set
Java Program to Find Number of Articulation points in a Graph
New in Spring Security OAuth2 – Verify Claims
Java Program to Solve Tower of Hanoi Problem using Stacks
Using a Custom Spring MVC’s Handler Interceptor to Manage Sessions
Java Program to Perform Insertion in a 2 Dimension K-D Tree
Spring Boot - Build Systems
A Custom Media Type for a Spring REST API
Java Program to Delete a Particular Node in a Tree Without Using Recursion
Lập trình đa luồng với Callable và Future trong Java