java bubble sort program code example
Example 1: bubble sort java
public class BubbleSortExample {
static void bubbleSort(int[] arr) {
int n = arr.length;
int temp = 0;
for(int i=0; i < n; i++){
for(int j=1; j < (n-i); j++){
if(arr[j-1] > arr[j]){
//swap elements
temp = arr[j-1];
arr[j-1] = arr[j];
arr[j] = temp;
}
}
}
}
Example 2: bubble sort in java
public static void bubbleSort(int arr[])
{
for (int i = 0; i < arr.length; i++) //number of passes
{
//keeps track of positions per pass
for (int j = 0; j < (arr.length - 1 - i); j++) //Think you can add a -i to remove uneeded comparisons
{
//if left value is great than right value
if (arr[j] > arr[j + 1])
{
//swap values
int temp = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = temp;
}
}
}
}
Example 3: Java program bubble sort in ascending and descending order
// Bubble sort descending order
import java.util.Scanner;
public class BubbleSortDescending
{
public static void main(String[] args)
{
int number, a, b, temp;
Scanner sc = new Scanner(System.in);
System.out.println("Please enter number of integers: ");
number = sc.nextInt();
int[] arrInput = new int[number];
System.out.println("Enter " + number + " integers: ");
for(a = 0; a < number; a++)
arrInput[a] = sc.nextInt();
for(a = 0; a < (number - 1); a++)
{
for(b = 0; b < number - a - 1; b++)
{
// logic to sort in descending order
if(arrInput[b] < arrInput[b + 1])
{
temp = arrInput[b];
arrInput[b] = arrInput[b + 1];
arrInput[b + 1] = temp;
}
}
}
sc.close();
System.out.println("Sorted integers: ");
for(a = 0; a < number; a++)
System.out.println(arrInput[a]);
}
}