Java Day 20: Sorting
Given an array, a, of size n distinct elements, sort the array in ascending order using the Bubble Sort algorithm above. Once sorted, print the following 3 lines:
- import java.io.*;
- import java.util.*;
- import java.text.*;
- import java.math.*;
- import java.util.regex.*;
-
- public class Solution {
-
- public static void main(String[] args) {
- Scanner in = new Scanner(System.in);
- int n = in.nextInt();
- int arr[] = new int[n];
- for (int i = 0; i < n; i++) {
- arr[i] = in.nextInt();
- }
-
- int numSwaps = 0;
- for (int i = 0; i < n; i++) {
- for (int j = 0; j < n - 1; j++) {
- if (arr[j] > arr[j + 1]) {
- int tmp = arr[j];
- arr[j] = arr[j + 1];
- arr[j + 1] = tmp;
- numSwaps++;
- }
- }
-
- if (numSwaps == 0) {
- break;
- }
- }
-
- System.out.println("Array is sorted in " + numSwaps + " swaps.");
- System.out.println("First Element: " + arr[0]);
- System.out.println("Last Element: " + arr[arr.length - 1]);
- }
- }