Home Java Beginners Arrayexamples Bubble Sorting in Java

Related Tutorials


 
 

Share on Google+Share on Google+

Bubble Sorting in Java

Advertisement
In this example we are going to sort integer values of an array using bubble sort.

Bubble Sorting in Java

     

Introduction

In this example we are going to sort integer values of an array using bubble sort.

Bubble sort is also known as exchange sort. Bubble sort is a simplest sorting algorithm. In bubble sort algorithm array is traversed from 0 to the length-1 index of the array and compared one element to the next element and swap values in between if the next element is less than the previous element. In other words, bubble sorting algorithm compare two values and put the largest value at largest index. The algorithm follow the same steps repeatedly until the values of array is sorted. In worst-case the complexity of bubble sort is O(n2) and in  best-case the complexity of bubble sort is Ω(n).
  
Code description:

Bubble Sorting is an algorithm in which we are comparing first two values and put the larger one at higher index. Then we take next two values compare these values and place larger value at higher index. This process do iteratively until the largest value is not reached at last index. Then start again  from zero index up to n-1 index. The algorithm follows the same steps iteratively unlit elements are not sorted. 

Advertisement

Working of bubble sort algorithm:

Say we have an array unsorted  A[0],A[1],A[2]................ A[n-1] and A[n] as input. Then the following steps are followed by bubble sort algorithm to sort the values of an array.
 1.Compare A[0] and A[1] . 
 2.If A[0]>A[1] then Swap A[0] and A[1].
 3.Take next A[1] and A[2].
 4.Comapre these values.
 5.
If A[1]>A[2]  then swap A[1] and A[2]
 ...............................................................
................................................................
at last compare A[n-1] and A[n]. If A[n-1]>A[n] then swap A[n-1] and A[n]. As we see the highest value is reached at nth position. At next iteration leave nth value. Then apply the same steps repeatedly on A[0],A[1],A[2]................ A[n-1] elements repeatedly until the values of array is sorted.

In our example we are taking the following array values
12 9 4 99 120 1 3 10

The basic steps followed by algorithm:-
  
In the first step compare first two values 12 and 9.
12 9 4 99 120 1 3 10

As 12>9 then we have to swap these values 
Then the new sequence will be 
9 12 4 99 120 1 3 10

In next step take next  two values 12 and 4 
9 12 4 99 120 1 3 10

Compare these two values .As 12>4 then we have to swap these values. 
Then the new sequence will be
9 4 12 99 120 1 3 10

We have to follow similar steps up to end of array. e.g.
9 4 12 99 120 1 3 10
9 4 12 99 120 1 3 10
9 4 12 99 1 120 3 10 
9 4 12 99 1 120 3 10
9 4 12 99 1 3 120 10
9 4 12 99 1 3 10 120

When we  reached at last index .Then restart same steps unlit the data is not sorted.

The output of this example will be :
1 3 4 9 10 12 99 120 

The code of the program :

public class bubbleSort{
  public static void main(String a[]){
  int i;
  int array[] {12,9,4,99,120,1,3,10};
  System.out.println("Values Before the sort:\n");
  for(i = 0; i < array.length; i++)
  System.out.printarray[i]+"  ");
  System.out.println();
  bubble_srt(array, array.length);
  System.out.print("Values after the sort:\n");
  for(i = 0; i <array.length; i++)
  System.out.print(array[i]+"  ");
  System.out.println();
  System.out.println("PAUSE");
  }

  public static void bubble_srtint a[]int ){
  int i, j,t=0;
  for(i = 0; i < n; i++){
  for(j = 1; j < (n-i); j++){
  if(a[j-1> a[j]){
  t = a[j-1];
  a[j-1]=a[j];
  a[j]=t;
  }
  }
  }
  }
}

Output of the example:

C:\array\sorting>javac bubbleSort.java
C:\array\sorting>java bubbleSort
Values Before the sort:
12  9  4  99  120  1  3  10
Values after the sort:
1  3  4  9  10  12  99  120
PAUSE
C:\array\sorting>_

Download this example.

Advertisements

If you enjoyed this post then why not add us on Google+? Add us to your Circles



Liked it!  Share this Tutorial


Follow us on Twitter, or add us on Facebook or Google Plus to keep you updated with the recent trends of Java and other open source platforms.

Posted on: May 28, 2007

Related Tutorials

Discuss: Bubble Sorting in Java   View All Comments

Post your Comment


Your Name (*) :
Your Email :
Subject (*):
Your Comment (*):
  Reload Image
 
 
Comments:25
jollibee
December 13, 2012
programming

what is the best technique in programming?
nilo botay
September 30, 2012
cs125(descrete math)

your code is very good you know?i almost understand it but i do not..paglung-ag sa sa sunod para dili ta manga pasmo huh??
pooja nakil
October 18, 2012
core java

easy to understand nice...............
Gamer
December 30, 2012
Bubble sort

WHy can't we do bubble sort with only one for loop ??
Alvin
December 4, 2012
Hi

Nice!
Bryan Hayag
June 20, 2013
My Version of Bubble Sort

//You can try this Code if this fits your needs... import java.io.*; import java.util.*; public class BubbleSort { public static void main(String args[]) throws IOException { int i; Scanner in = new Scanner(System.in); System.out.println("Please enter number of items to Sort:"); int nItems = in.nextInt(); int[] ax = new int[nItems]; for (i=0;i<nItems;i++) { System.out.print("\nEnter a Number:"); ax[i]=in.nextInt(); } bubble_srt(ax, ax.length); System.out.print("\nThe values after sort: \n"); for (i=0; i< ax.length; i++) { System.out.print(ax[i]+" "); } System.out.println(); System.out.println("\nPAUSE..."); } public static void bubble_srt(int a[], int n) { int i,j,t=0; for (i=0; i<n; i++) { for (j=1; j<(n-i); j++) { if (a[j-1] > a[j]) { t=a[j-1]; a[j-1]=a[j]; a[j]=t; } } } } }
aki claks
June 30, 2013
data structure

thanks for the codes, it helps a lot but how can i convert it into (GUI)Graphical User Interface?
JV a'k'a ( Lee Min Ho )
March 19, 2014
MY COOOOOOOOMENT !

All i can say about the program is AWESOME ! :)
Niladri Dutta
November 24, 2011
Wrong statement

Objection avi the actual statement is for(j=0;j<n-i-1;j++)
DMCA.com