Sorting : Buble Sort

Bubble sort is a sorting algorithm that works by repeatedly stepping through lists that need to be sorted, comparing each pair of adjacent items and swapping them if they are in the wrong order. This passing procedure is repeated until no swaps are required, indicating that the list is sorted. Bubble sort gets its name because smaller elements bubble toward the top of the list.

Bubble Sort

Bubble sort is also referred to as sinking sort or comparison sort. Bubble sort has a worst-case and average complexity of O(n2), where n is the number of items sorted. Unlike the other sorting algorithms, bubble sort detects whether the sorted list is efficiently built into the algorithm. Bubble sort performance over an already sorted list is O(n).

/** * */ package com.developerstechpoint.sorting; import java.util.Scanner; /** * @author jeetendra * */ public class BubbleSort { /** * @param args */ public static void main(String[] args) { Scanner sc = new Scanner(System.in); System.out.println("Enter The number of Array's Elements of which is to be sorted===>"); int number = sc.nextInt(); int array[]=new int[number]; System.out.println("Enter The "+number+ " Integer in the following Array===>"); for(int i=0; i<number; i++){ array [i] = sc.nextInt(); } // Sorting for(int i=0; i<(number-1); i++){ for(int j=0; j<number-i-1; j++){ int temp; if(array[j] > array[j+1]){ temp=array[j]; array[j]= array[j+1]; array[j+1]=temp; } } } String temp=""; for(int i=0; i<number; i++){ //System.out.println(array[i]); temp=temp+" "+array[i]; } System.out.println("Sorted Array is:"+"\n"+temp); } } /*Enter The number of Array's Elements of which is to be sorted===> 5 Enter The 5 Integer in the following Array===> 9 1 8 3 7 Sorted Array is: 1 3 7 8 9 * */