Insertion Sort(Java)

 1 //Insertion Sort
 2 
 3 for(int i = 1; i < a.length; i++)
 4 {
 5     int key = a[i];
 6     int j;
 7     for(j = i - 1; j >= 0 && a[j] > key; j--)
 8         a[j + 1] = a[j];
 9     a[j + 1] = key;
10 }

 

转载于:https://www.cnblogs.com/Huayra/p/10502964.html