Java Source Code sample: Sort Numbers in Bubble Sort
By aisha91
Below is the java source code on sorting numbers using bubble sort . You can decide on how to sort a number either ascending or descending by just changing the comparison operator in the method BubbleSort.There are many sorting algorithms on sorting numbers but the most used is the selection sort. Actually, bubble sort is not a better choice on sorting numbers but it is pretty good to program while learning different sorting algorithms as well as recursion. It exposed the programmers on different ways on how to solve and program a certain problem and widen his/her knowledge as well as be able to compare its usefulness. After this program I will also upload the selection sort.
Updated:
Below is the quick link for the selection sort.
How Bubble Sort Works?
Bubble sort sorts numbers by comparing the number and its following number. For example we will sort the entered 6 numbers in ascending way and here is the user's input.
2 5 3 4 1 6
The first number is 2 and the following number is 5. Is 2 < 5? if yes, proceed. The second comparison will be 5 and 3. Is 5 < 3? since the answer is no, it will sort the numbers in this way.
2 3 5 4 1 6
Then, the next comparison is 5 and 4 and so on until it will be sorted properly from lowest to highest. Here is the complete list on how the numbers above sorted in bubble sort.
2 3 4 5 1 6
2 3 4 1 5 6
2 3 1 4 5 6
2 1 3 4 5 6
1 2 3 4 5 6 - end of sorting and this correct sorted numbers is what the program outputs to the screen
Below is the source code,
Java Source Code: How to sort numbers in Bubble Sort
//java class
public class BubbleSort
{
public void bubbleSort(int[] arr){
for(int i=0; i<arr.length; i++){
for(int j=1; j<arr.length; j++){
if(arr[j]< arr[j-1] ){
int temp = arr[j];
arr[j] = arr[j-1];
arr[j-1] = temp;
}
}
}
for(int i=0; i<arr.length; i++)
{
System.out.print(arr[i] + " ");
}
}
}
//main class
import java.util.Scanner;
public class Main
{
public static void main(String[] args)
{
Scanner input = new Scanner(System.in);
System.out.print("Enter the size of the array: ");
int n = input.nextInt();
int[] x = new int[n];
System.out.print("Enter "+ n +" numbers: ");
for(int i=0; i<n; i++)
{
x[i] = input.nextInt();
}
BubbleSort access = new BubbleSort();
System.out.print("The Sorted numbers: ");
access.bubbleSort(x);
}
}
Sample Output:
Enter the size of the array: 10
Enter 10 numbers: 100 35 45 3 7 2 1 500 200 15
The Sorted Numbers: 1 2 3 7 15 35 45 100 200 500
Want More Java sample Codes ?Choose codes below.
Cool Mini Computers
|
|
7" Mini Laptop Netbook Notebook Computer PC VIA8650 800Mhz Wifi ANDROID 2.2
Current Bid: $83.99
|
|
|
Verizon HP Mini 1151NR Laptop Netbook PC 3G Used Black Computer No Contract
Current Bid: $134.99
|
|
|
4GB 10" WiFi mini Laptop Notebook Computer Netbook VIA8650 Android 2.2
Current Bid: $132.99
|
|
|
Verizon HP Mini 1152NR Notebook Netbook PC 3G Computer No Contract
Current Bid: $114.99
|
- Java Simple Codes for Beginners
- A Java source code: How to Output Asterisk in Different Forms Using Recursion
- Java Source Code: A Recursive Asterisk Diamond Shape
- Java Source code: How to Add Numbers inside an Array using For Loop
- Java Source code: How to Add numbers inside an Array Using Recursion
- Java Source Code: Sort Numbers using Selection Sort
- Java Source Code on a Recursive Linear Search
- Java Source Code: Binary Search in Recursion
- Java Source code: How to Print a String Backward using Recursion
- Java Source code on Printing the Greatest Common Divisor (GCD) using Recursion
- Java source code: How to Output the Answer of the Integer X to the Power Y
- Java Source Code: How to make a Program that will determine a Person's Salutation and Current Age
- Java Source Code: Recursive Snow Flakes
Perhaps, you might find these following hubs helpful.


aloha 2 months ago
How can this code be modified to include a System.out.print of the unsorted integers that have been entered ???