目录
一:冒泡排序思想
二:冒泡排序代码
package totoSort;
import java.util.Arrays;
public class TotoSort {
public static void main(String[] args) {
int[] arrays = new int[] {6,5,4,3,2,1};
System.out.println(Arrays.toString(arrays));
sort(arrays);
System.out.println(Arrays.toString(arrays));
}
public static void sort(int[] arrays) {
int temp = 0;
//比较几轮
for(int i = 0; i < arrays.length - 1; i++) {
for(int j = 0; j < arrays.length - 1 - i; j++) {
if(arrays[j] > arrays[j + 1]) {
temp = arrays[j];
arrays[j] = arrays[j + 1];
arrays[j + 1] = temp;
}
}
}
}
}
三:结果