插入排序-----Insertion Sort

public static void main(String[] args) {
// TODO Auto-generated method stub

int[] squencess = {31,41,59,26,41,58};
for(int i=0;i<insert_sort(squencess).length;i++){
System.out.print(" "+squencess[i]);
}

}

//升序
private static int[] insert_sort(int[] squence) {
int insert_value,sort_key;

for(int position = 1; position < squence.length; position++) {
insert_value = squence[position];//待插入数据;
sort_key = position-1;//有序序列下标
while(sort_key >= 0 && insert_value<squence[sort_key]) {
squence[sort_key+1] = squence[sort_key];
sort_key--;
}
squence[sort_key+1] = insert_value;
}
return squence;
}