void insertion_sort(char array[], unsigned int first, unsigned int last)
{
        int i,j;
        int temp;
        for (i = first+1; i<=last;i++)
        {
                temp = array[i];
                j=i-1;
                
                //與已排序的數逐一比較, 大於temp時, 該數移後
                while((j>=first) && (array[j] > temp))
                {
                        array[j+1] = array[j];  
                        j--;
                }
                
                array[j+1] = temp;      
        }
}
這個更好:

void InsertSort(char array[],unsigned int n)
{
   int i,j;
   int temp;
   for(i=1;i<n;i++)
   {
     temp = array[i];//store the original sorted array in temp
     for(j=i ; j>0 && temp < array[j-1] ; j--)//compare the new array with temp
     {
         array[j]=array[j-1];//all larger elements are moved one pot to the right
     }
    array[j]=temp;
   }
}