Implementar el algoritmo Bubble Sort. Java

#burbuja #java #clasificar

Java

import java.util.Arrays;
import java.util.Scanner;

class Main {

Scanner input = new Scanner(System.in);

void bubbleSort(int array[]) {
    int size = array.length;

System.out.println("Choose Sorting Order:");
    System.out.println("1 for Ascending \n2 for Descending");
    int sortOrder = input.nextInt();

for (int i = 0; i < size - 1; i++)

for (int j = 0; j < size - i - 1; j++)

if (sortOrder == 1) {
          // compares the adjacent element
          if (array[j] > array[j + 1]) {

int temp = array[j];
            array[j] = array[j + 1];
            array[j + 1] = temp;
          }
        }

else {
          if (array[j] < array[j + 1]) {

int temp = array[j];
            array[j] = array[j + 1];
            array[j + 1] = temp;
          }
        }

}

public static void main(String args[]) {

int[] data = { -2, 45, 0, 11, -9 };

Main bs = new Main();

bs.bubbleSort(data);
    System.out.println("Sorted Array in Ascending Order:");

System.out.println(Arrays.toString(data));
  }
}

Output result

Choose Sorting Order:
1 for Ascending 
2 for Descending
1
Sorted Array:
[-9, -2, 0, 11, 45]

Java

ejemplos de código y respuesta a preguntas en lenguaje de programación Java