Code Snippets

Java Source Code

Welcome to Dream.In.Code
	Become a Java Expert! Join 300,314 Java Programmers for FREE! Get instant access to thousands of Java experts, tutorials, code snippets, and more! There are 2,057 people online right now. Registration is fast and FREE... Join Now! Chat LIVE With a Java Expert

Bubble Sort

The bubble sort provides a simple way to sort an array. Simple modifications can change it to sort decrementally (highest to lowest).

Submitted By: SPlutard

Actions:

Rating:

Views: 29,179

Language: Java

Last Modified: August 9, 2006

Instructions: Feel free to copy & paste the bubbleSort method into your app.

Snippet

/* Snippet: Bubble Sort Method
* Author: SPlutard
*
* Description: The Bubble Sort method works like this:
* In a series of n-1 iterations, the successive elements, list[index] and list[index + 1] of list are compared.
* If list[index] is greater than list[index + 1], then the elements of list[index] and list[index + 1] are swapped.
* This process is repeated through the list until no swaps are necessary.
* On average, for a list with length 'n', the Bubble Sort method takes:
* key comparisons: (n*(n-1))/2
* item assignments: (n*(n-1))/4
*/
public class TestBubbleSort {
public static void main(String[] args) {
int unsortedArray[] = {10, 97, 6, 23, 0, -45, 697, -1000, 1, 0}; //Random set of numbers for example.
int i;
bubbleSort(unsortedArray, unsortedArray.length); //Pass the array to be sorted and its length.
System.out.println("After sorting, the list elements are: "); //Just to show you it worked. :)
for(i=0; i<unsortedArray.length; i++) {
System.out.print(unsortedArray[i] + " ");
}
}
private static void bubbleSort(int[] unsortedArray, int length) {
int temp, counter, index;
for(counter=0; counter<length-1; counter++) { //Loop once for each element in the array.
for(index=0; index<length-1-counter; index++) { //Once for each element, minus the counter.
if(unsortedArray[index] > unsortedArray[index+1]) { //Test if need a swap or not.
temp = unsortedArray[index]; //These three lines just swap the two elements:
unsortedArray[index] = unsortedArray[index+1];
unsortedArray[index+1] = temp;
}
}
}
}
}

Copy & Paste

/* Snippet: Bubble Sort Method
 * Author: SPlutard
 *
 * Description: The Bubble Sort method works like this: 
 *      In a series of n-1 iterations, the successive elements, list[index] and list[index + 1] of list are compared.
 *      If list[index] is greater than list[index + 1], then the elements of list[index] and list[index + 1] are swapped.
 *      This process is repeated through the list until no swaps are necessary.
 *      On average, for a list with length 'n', the Bubble Sort method takes:
 *          key comparisons:    (n*(n-1))/2              
 *          item assignments:   (n*(n-1))/4              
 */

public class TestBubbleSort {
    public static void main(String[] args) {
        int unsortedArray[] = {10, 97, 6, 23, 0, -45, 697, -1000, 1, 0}; //Random set of numbers for example.
        int i;
        
        bubbleSort(unsortedArray, unsortedArray.length); //Pass the array to be sorted and its length.
        
        System.out.println("After sorting, the list elements are: "); //Just to show you it worked. :)
        
        for(i=0; i<unsortedArray.length; i++) {
            System.out.print(unsortedArray[i] + " ");
        }
    }

private static void bubbleSort(int[] unsortedArray, int length) {
        int temp, counter, index;
        
        for(counter=0; counter<length-1; counter++) { //Loop once for each element in the array.
            for(index=0; index<length-1-counter; index++) { //Once for each element, minus the counter.
                if(unsortedArray[index] > unsortedArray[index+1]) { //Test if need a swap or not.
                    temp = unsortedArray[index]; //These three lines just swap the two elements:
                    unsortedArray[index] = unsortedArray[index+1];
                    unsortedArray[index+1] = temp;
                }
            }
        }
    }
}

Comments
edukondalut 2008-07-07 01:14:32
its better to execute in run time too.
sarvesh_tanwar 2009-01-08 11:01:21
i am making a project on byzentine intigrated secure aodv menet routing procotocol in java. plz help me in coding.thanks
dinesh_123 2009-03-11 15:03:41
iam making online graphics editing system using java platform. plz help me in coding thanx
dinesh_123 2009-03-11 15:04:37
plz provide me code to edit the image using java servlets
zanyrogue 2009-04-14 13:02:48
What package is bubbleSort in?
rahulietlko 2009-08-30 05:50:00
plz get me the code for implemeting the "bubble sort in java in which input of numbers which are to be sorted are to be taken from a file"......get me code its vry necessary