package com.neuedu.InsertionSort;
public class InsertSort {
public static void main(String[] args) {
int[] a={1,48,5,-8,0};
insertionSort(a);
for(int i:a){
System.out.print(i+" ");
}
}
private static void insertionSort(int[] a) {
// TODO Auto-generated method stub
for(int i=1;i<a.length;i++){
int flag=a[i];
int k=i-1;
for(;k>=0&&a[k]>flag;k--){
a[k+1]=a[k];
}
a[k+1]=flag;
}
}
}
插入排序
最新推荐文章于 2024-12-13 15:13:27 发布