package com.sinosoft.thesecondofaugust;
/**
* 插入排序
* @author lescen
*
*/
public class InsertSort {
public static void main(String[] args) {
int r[]={49,27,65,97,76,13,38,5,12,56}; //给出原始数的序列
System.out.println("排序前的数组为:");
for (int num : r) {
System.out.print(num+" ");
}
for(int i=1;i<r.length;i++){
if(r[i-1]>r[i]){
int temp = r[i];
int j=i;
while(j>0 && r[j-1]>temp){
r[j]=r[j-1];
j--;
}
r[j]=temp;
}
}
System.out.println("\n"+"排序后的数组为");
for (int num : r) {
System.out.print(num+" ");
}
}
}