Bubble Sort

BubbleSort.java

// Java program for implementation of Bubble Sort
class BubbleSort
{
    void bubbleSort(int arr[])
    {
        int n = arr.length;
        int j = 0;
        boolean swap;
        // last element don't need to be considered as it will be in right position by itself if all other are in position
        for (int i = 0; i < n-1; i++){
            swap = false;
            // we don't need to consider last - 1 element as we check j+1 element
            for (j = 0; j < n-i-1; j++){
                if (arr[j] > arr[j+1])
                {
                    // swap temp and arr[i]
                    int temp = arr[j];
                    arr[j] = arr[j+1];
                    arr[j+1] = temp;
                    swap = true;
                }
            }    
            if(swap == false) 
                break;
        }
    }

    /* Prints the array */
    void printArray(int arr[])
    {
        int n = arr.length;
        for (int i=0; i<n; ++i)
            System.out.print(arr[i] + " ");
        System.out.println();
    }

    // Driver method to test above
    public static void main(String args[])
    {
        BubbleSort ob = new BubbleSort();
        int arr[] = {164, 34, 2, 2229};
        // int arr[] = {4, 9, 10, 12};
        ob.bubbleSort(arr);
        System.out.println("Sorted array");
        ob.printArray(arr);
    }
}