HackerRank Solutions – Bubble Sort – Java Solution
All credits to Rodney Shaghoulian for this simple solution for the HackerRank challenge – Bubble Sort. This solution is written in Java.
// Author: Rodney Shaghoulian // Github: github.com/RodneyShag import java.util.Scanner; public class Solution { private static int swaps = 0; public static void main(String[] args) { /* Save input */ Scanner scan = new Scanner(System.in); int size = scan.nextInt(); int [] array = new int[size]; for (int i = 0; i < size; i++) { array[i] = scan.nextInt(); } scan.close(); bubbleSort(array); System.out.println("Array is sorted in " + swaps + " swaps."); System.out.println("First Element: " + array[0]); System.out.println("Last Element: " + array[array.length - 1]); } private static void bubbleSort(int [] array) { if (array == null) { return; } boolean swapped = true; int endOffset = 0; // optimizes code while (swapped) { swapped = false; for (int i = 1; i < array.length - endOffset; i++) { if (array[i-1] > array[i]){ swap(array, i-1, i); swapped = true; } } endOffset++; } } /* Standard swap. Also updates our "swaps" variable */ private static void swap(int [] array, int i, int j) { int temp = array[i]; array[i] = array[j]; array[j] = temp; swaps++; } }