Bubble Sort Algorithm

  import java.util.*;

    class BubbleSort {
    
      public int[] sort(int a[]) {
        boolean isSorted = false;
    
        while (!isSorted) {
          isSorted = true;
          for (int i = 0; i < a.length - 1; i++) {
            if (a[i] > a[i + 1]) {
              swap(a, i, i + 1);
              isSorted = false;
            }
          }
        }
    
        return a;
      }
    
      public static void swap(int[] array, int i, int j) {
        int temp = array[i];
        array[i] = array[j];
        array[j] = temp;
      }
    
      public static void main(String args[]) {
        BubbleSort bS = new BubbleSort();
    
        int[] element = {6, 7, 3, 2, 1, 9, 4};
        System.out.print("Original array: ");
        for(Integer i : element){
            System.out.print(i + "  ");
        }
        int[] result = bS.sort(element);
        System.out.println();
        System.out.println("- - - - - - - - - - - - - - - - - - - - - - - - - - - -");
    
        System.out.print("Sorted array: ");
        for(Integer i : result){
        System.out.print(i + "  ");
        }
      }
  }