/**
* 插入排序
* 思路:
* 类似玩扑克牌,手里的牌有序,新插入的牌必须保证插入后牌有序
* 有点像往前的冒泡排序
* @author ZSL
*/
public class InputSort {
public static void main(String[] args) {
int[] arrs = {3,5,2,9,1,7,4,6,8};
int len = arrs.length;
System.out.println("原数组:");
print(arrs);
for (int i = 1; i < len; i++) {
for (int j = i; j >0; j--) {
if (arrs[j]<arrs[j-1]){
swap(arrs,j,j-1);
}
}
}
System.out.println("排序后:");
print(arrs);
}
private static void print(int[] arr){
for (int i = 0; i < arr.length; i++) {
System.out.print(arr[i]+" ");
}
System.out.println();
}
private static void swap(int[] arr,int i,int pos){
int temp;
temp=arr[i];
arr[i]=arr[pos];
arr[pos]=temp;
}
}