1.冒泡排序
口诀:相邻比较,外层循环n-1,里层循环n-1-i
for(int i = 0; i < array.length - 1;i++){
for(int j = 0;j < array.length - 1 - i;j++){
if(array[j] > array[j+1]){
int temp = array[j];
array[j] = array[j+1];
array[j+1] = temp;
}
}
}
2.选择排序
口诀:前后比较,外层起点0,里层起点i+1
for(int i = 0;i < array.length - 1;i++){
for(int j = i+1;j <= array.length - 1 ;j++){
if(array[j] > array[j+1]){
int temp = array[j];
array[j] = array[j+1];
array[j+1] = temp;
}
}
}