Java program to bubble sort: This code sorts numbers inputted by user using Bubble sort algorithm.
Java programming code
- import java.util.Scanner;
- class BubbleSort {
- public static void main(String []args) {
- int n, c, d, swap;
- Scanner in = new Scanner(System.in);
- System.out.println("Input number of integers to sort");
- n = in.nextInt();
- int array[] = new int[n];
- System.out.println("Enter " + n + " integers");
- for (c = 0; c < n; c++)
- array[c] = in.nextInt();
- for (c = 0; c < ( n - 1 ); c++) {
- for (d = 0; d < n - c - 1; d++) {
- if (array[d] > array[d+1]) /* For descending order use < */
- {
- swap = array[d];
- array[d] = array[d+1];
- array[d+1] = swap;
- }
- }
- }
- System.out.println("Sorted list of numbers:");
- for (c = 0; c < n; c++)
- System.out.println(array[c]);
- }
- }
Complexity of bubble sort is O(n2) which makes it a less frequent option for arranging in sorted order when quantity of numbers is high.
Download Bubble sort Java program.
Output of program:
You can also use sort method of Arrays class to sort integers in ascending order but remember that sort method uses a variation of Quick sort algorithm.
- import java.util.Arrays;
- class Sort
- {
- public static void main(String args[])
- {
- int data[] = { 4, -5, 2, 6, 1 };
- Arrays.sort(data);
- for (int c: data)
- {
- System.out.println(c);
- }
- }
- }