1.插入排序
注意点:k应该是大于等于0,而不是大于0。
package practice;
import java.util.*;
public class sort{
public static void main(String args[]){
ArrayList<Integer> list = new ArrayList<>();
for(int i=0;i<15;i++){
list.add((int) (Math.random()*100));}
System.out.println(list);
mysort(list);
System.out.println(list);
}
private static void mysort(ArrayList<Integer> list) {
for(int i=0;i<list.size()-1;i++){
int currentE = list.get(i+1);
int currentindex = i;
for(int k=i;k>=0&&list.get(k)>currentE;k--){
list.set(k+1, list.get(k));
currentindex = k;
}
list.set(currentindex, currentE);
}
}
}
运行结果:
[43, 46, 52, 85, 97, 39, 36, 49, 27, 95, 55, 71, 96, 90, 7]
[7, 27, 36, 39, 46, 49, 52, 55, 71, 85, 90, 95, 96, 97, 97]
2.冒泡排序:
注意点:内层循环J应该从0开始。
package practice;
public class sort{
public static void main(String args[]){
int[] list = new int[15];
for(int i=0;i<list.length;i++)
list[i] = (int) (Math.random()*100);
for(int k:list)
System.out.print(k+" ");
mysort(list);
System.out.println();
for(int k:list)
System.out.print(k+" ");
}
private static void mysort(int[] list) {
for(int i=0;i<list.length-1;i++){
for(int j=0;j<list.length-1;j++){
if(list[j]>list[j+1])
swap(list,j);}}
}
private static void swap(int[] list, int j) {
int temp = list[j+1];
list[j+1] = list[j];
list[j] = temp;
}
}
运行结果
71 36 97 69 56 27 75 95 3 2 17 52 53 67 35
2 3 17 27 35 36 52 53 56 67 69 71 75 95 97
3.归并排序。