/**
 *  Average case performance: O(n^2)
 *  Best case performance:    O(n)
 *  Worst case performance:   O(n^2)
 */
public class BubbleSort {

    /**
     * @param a Array of integers which are sorted when returns.
     */
    public static void sort(int[] a)
    {
        if(a==null||a.length==0)
            return;
        
        int temp;
        for(int k=a.length; k>1; k--){
            for(int j=1; j<i; j++){
                if(a[j]<a[j-1]){
                    temp = a[j-1]; 
                    a[j-1] = a[j];
                    a[j] = temp;
                }
            }
        }
    }
}