/** * 冒泡排序算法 * @author flyever581549 * * 2010-11-19上午07:27:05 */ public class BufferSort { public static void main(String [] args){ int [] data = new int[]{155,8,250,7,656,554}; sort(data); for(int i:data){ System.out.print(i+" "); } } public static void sort(int [] data){ int size = data.length; for(int i=1;i<size;i++){ for(int j=0;j<size-i;j++){ if(data[j]>data[j+1]){ int temp = data[j]; data[j] = data[j+1]; data[j+1] = temp ; } } } } }