public void insertSort(int arr[]){
for (int i = 1; i < arr.length; i++) {
int curValue = arr[i];
int curPos = i-1;
while (curPos>=0&&curValue<arr[curPos]){
arr[curPos+1] = arr[curPos];
curPos--;
}
arr[curPos+1] = curValue;
}
}
2.1插入算法
猜你喜欢
转载自blog.csdn.net/aa375809600/article/details/81391782
今日推荐
周排行