BubbleSort.java

import java.util.*;

public class BubbleSort
{
    public void Sort(int[] arr) //creating a function with the name of Sort which exactly does what is says
    {
        int n = arr.length; // getting length of the array
        
        for(int i=0;i<n;i++)
        {
            boolean swapped = false; // creating a boolean variable to check if the array is sorted or not
            for(int j=0;j<n-i-1;j++)
            {
                if(arr[j]>arr[j+1]) //checking for the condition for ascending order
                {
                    int temp = arr[j]; //swapping the elements based on the condition
                    arr[j]=arr[j+1];
                    arr[j+1]=temp;

                    swapped = true;
                }
            }

            if(!swapped) //checking if the program hit a break
            break;
        }
    }


    public static void main(String[] args) { //creating main method
        BubbleSort obj = new BubbleSort();
        Scanner xp = new Scanner(System.in);
        System.out.println("Enter the size of the array");
        int n = xp.nextInt();
        int[] arr = new int[n];
        System.out.println("Enter the elements of the array");
        for(int i=0;i<n;i++)
        {
            arr[i]=xp.nextInt();
        }
        obj.Sort(arr); //passing the current array into sort function to sort it
        System.out.println("The sorted array is");
        for(int i=0;i<n;i++)
        {
            System.out.print(arr[i]+" ");
        }
        xp.close(); //closing the scanner class
    }
}


// Optimized java implementation of Bubble sort

// import java.io.*;

// class GFG {
	
// 	// An optimized version of Bubble Sort
// 	static void bubbleSort(int arr[], int n)
// 	{
// 		int i, j, temp;
// 		boolean swapped;
// 		for (i = 0; i < n - 1; i++) {
// 			swapped = false;
// 			for (j = 0; j < n - i - 1; j++) {
// 				if (arr[j] > arr[j + 1]) {
					
// 					// Swap arr[j] and arr[j+1]
// 					temp = arr[j];
// 					arr[j] = arr[j + 1];
// 					arr[j + 1] = temp;
// 					swapped = true;
// 				}
// 			}

// 			// If no two elements were
// 			// swapped by inner loop, then break
// 			if (swapped == false)
// 				break;
// 		}
// 	}

// 	// Function to print an array
// 	static void printArray(int arr[], int size)
// 	{
// 		int i;
// 		for (i = 0; i < size; i++)
// 			System.out.print(arr[i] + " ");
// 		System.out.println();
// 	}

// 	// Driver program
// 	public static void main(String args[])
// 	{
// 		int arr[] = { 64, 34, 25, 12, 22, 11, 90 };
// 		int n = arr.length;
// 		bubbleSort(arr, n);
// 		System.out.println("Sorted array: ");
// 		printArray(arr, n);
// 	}
// }

// This code is contributed
// by Nikita Tiwari.