冒泡排序算法的java实现

package learn.java;

public class BubbleSort {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		int[] pendingSort={3,5,9,1,7,2};//n-1 times
		for(int index=0;index<pendingSort.length-1;index++)
		{
		  	for(int i=0;i<pendingSort.length-1-index;i++)
		  	{
		  		if(pendingSort[i]>pendingSort[i+1])
		  		{
					int temp;
		  			temp=pendingSort[i];
		  			pendingSort[i]=pendingSort[i+1];
		  			pendingSort[i+1]=temp;
		  		}
		  	}
		}
		for(int i=0;i<pendingSort.length;i++){
		System.out.print(pendingSort[i]);
		}
	}
}