Direct Insert Sort

1, find the insertion position of L (i) in l[1...i-1] K2, move all elements in l[k...i-1] back one position 3, copy L (i) to L (k)

  
 

   
  

  
void InsertSort(ElemType A[], int n)
   
  

  
{
   
  

  
int i, j;
   
  

  
for(i=2; i<=n; i++)//依次将A[2]~A[n]插入到前面已排序序列
   
  

  
{
   
  

  
if(A[i].key)<A[i-1].key)//如果A[i]的关键码小于其前驱，须将A[i]插入有序表
   
  

  
{
   
  

  
A  [ 0  ]=  a  [ i  ;  //copy as Sentinel, A[0] does not store element   
   
  

  
for(j=i-1; A[0].key<A[j].key; --j)//从后往前查找待插入位置
   
  

  
{
   
  

  
A[j+1]=A[j];//向后挪位
   
  

  
}
   
  

  
A[j+1]=A[0];//复制到插入位置
   
  

  
}
   
  

  
}
   
  

  
}
  
 

Time complexity O (n^2) stable sequencing

From for notes (Wiz)

Direct Insert Sort