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 main(String[] args) {
- Scanner scan = new Scanner(System.in);
- // point 1 ====================================================
- System.out.println("Please input the number of elements :");
- int n = scan.nextInt();
- // point 2 ====================================================
- int[] arr = new int[n]; // Define array for elements
- // point 3 ====================================================
- int i=0;
- do {
- System.out.printf("Please insert the [%d] element of array :",i);
- arr[i] = scan.nextInt();
- i++;
- } while(i<n);
- /*for(int i = 0; i < n; i++) // Input values to array
- {
- System.out.printf("Please insert the [%d] element of array :",i);
- arr[i] = scan.nextInt();
- }*/
- // point 4 ====================================================
- // PRINT BEFORE Sort
- System.out.println("BEFORE SORTING :");
- System.out.println(Arrays.toString(arr));
- // point 5 ====================================================
- BubbleSort(arr);
- // point 6 ====================================================
- // PRINT AFTER Sort
- System.out.println("AFTER SORTING :");
- System.out.println(Arrays.toString(arr));
- scan.close();
- }
- // MAIN ------------------ END ============================================================================
- // ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
- // BUBBLE SORT METHOD ==========================================BEGIN=============
- public static void BubbleSort(int[] arr)
- {
- int i=0;
- do {
- i++;
- //for(int i=0; i<arr.length-1; i++){
- for(int j = 0; j<arr.length-1-i; j++)
- {
- if(arr[j]>arr[j+1])
- {
- // SWAP elements
- int buff = arr[j];
- arr[j] = arr[j+1];
- arr[j+1] = buff;
- }
- }
- }while(i<arr.length-1-i);
- //}
- }
- }
Add Comment
Please, Sign In to add comment