插入排序
-自然語言描述：
有一個已經(jīng)有序的數(shù)據(jù)序列宿刮，要求在這個已經(jīng)排好的數(shù)據(jù)序列中插入一個數(shù)毅哗，但要求插入后此數(shù)據(jù)序列仍然有序溉潭。
-Java語言描述：
public static void sort(Comparable[] a){
int N = a.length;
for (int i = 1; i < N; i++){
for (int j = i; j > 0&&(a[j] < a[j -1]); j--){
Comparable temp = a[j];
a[j] = a[j -1];
a[j -1] = temp;
}
}
}
-驗證代碼：
public class Insertion {
public static void sort(Comparable[] a){
//升序
int N = a.length;
for(int i = 1; i < N; i++){
for (int j = i; j >0&&less(a[j],a[j -1]) ; j-- ) {
exch(a, j, j -1);
}
}
}
private static boolean less(Comparable v, Comparable w){ return v.compareTo(w) < 0; }
private static void exch(Comparable[] a, int i, int j){
Comparable t = a[i]; a[i] = a[j]; a[j] = t; }
private static void show(Comparable[] a){ // 在單行中打印數(shù)組
for (int i = 0; i < a.length; i++)
System.out.print(a[i] + " ");
System.out.println();
}
public static boolean isSorted(Comparable[] a){
int length = a.length;
for (int i = 1;i < length ;i++ ) {
if (less(a[i],a[i -1])) {
return false;
}
}
return true;
}
public static void main(String[] args) {
String[] a = In.readStrings();
sort(a);
assert isSorted(a);
show(a);
}
}
