Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- import java.util.Arrays;
- import java.util.Scanner;
- public class BubbleSort {
- public static void BubbleSort(int[] ARR){
- int j, Buff;
- boolean swap;
- do{
- swap = false;
- for (j = 0; j < ARR.length - 1; j++) {
- if(ARR[j] > ARR[j + 1]){
- swap = true;
- Buff = ARR[j];
- ARR[j] = ARR[j + 1];
- ARR[j + 1] = Buff;
- }
- }
- }while(swap);
- }
- public static void main(String[] args) {
- //point 1
- Scanner scan = new Scanner(System.in);
- System.out.println("Input number of elements: ");
- int n = scan.nextInt();
- //point 2
- int[] ARR = new int[n];
- //point 3
- for (int i = 0; i < n ; i++) {
- System.out.printf("Please input element [%d]", i);
- ARR[i] = scan.nextInt();
- }
- //point 4
- System.out.println("BEFORE SORTING: ");
- System.out.println(Arrays.toString(ARR));
- //point 5
- BubbleSort(ARR);
- //point 6
- System.out.println("AFTER SORTING: ");
- System.out.println(Arrays.toString(ARR));
- }
- }
Add Comment
Please, Sign In to add comment