/* File: insertion.c
   Insertion Sort Routine
*/

#include "sorting.h"

void insertion_sort(data A[], index low, index high) {
   index i, j ;
   data key ;

   for (i = low+1 ; i <= high ; i++) {

      key = A[i] ;

      j = i - 1 ; 
      while ( j >= low && A[j] > key) {
         A[j+1] = A[j] ;
         j-- ;
      }

      A[j+1] = key ;
   }
}