BubbleSort.java

import java.util.Scanner;
/*
 * ---------------
 * Time Complexity
 * Best case = O(n)
 * Worst, Average case = O(n^2)
 * --------------- 
 */
public class BubbleSort {
    public static void main(String []args){
        try (Scanner scan = new Scanner(System.in)) {
            int size;
            System.out.println("Enter the size: ");
            size = scan.nextInt();
            int arr[] = new int[size];
            for(int i=0;i<size;i++){
                arr[i] = scan.nextInt();
            }
            sort(arr,size);
            for(int i=0;i<size;i++){
                System.out.print(arr[i]+" ");
            }
        }
    }

    static void sort(int arr[],int n){
        int i, j, temp;
        boolean flag = false;
        for(i=0;i<n;i++){
            for(j=0;j<n-1;j++){
                if(arr[j+1]>arr[j]){
                    temp = arr[j+1];
                    arr[j+1] = arr[j];
                    arr[j] = temp;
                    flag = true;
                }
            }
            if(!flag){
                break;
            }
        }
    }
}