冒泡排序

public void sort(int[] data){
		int len= data.length;
		for(int i=0;i<len-1;i++){
			int temp= 0;
			boolean isExchanged = false;
			for(int j=0;j<len-i-1;j++)
			{
				if((data[j])>(data[j+1]))
				{
					temp = data[j];
					data[j] = data[j+1];
					data[j+1] = temp;
					isExchanged = true;
				}
			}
			if(!isExchanged)
			{
				break;
			}
		}
	}
	
	@Test
	public void  test(){
		int[] c ={4,9,23,1,45,27,5,2};
		sort(c);
		System.out.println("冒泡排序后：");
		for(int i=0;i<c.length;i++){
			System.out.println(c[i]+", ");
		}
	}