Funktion Insertion_Sort

void insertion_sort(int a [ ], int p[ ], int N )

{ int i, j, v ;

for ( i = 2 ; i <= N ; i++ )

{

v = a [ i ] ; j = i;

while ( a [ j-1 ] > v )

{ a [ j ] = a [ j-1 ] ; j--; }

a [ j ] = v ;

}

/* Programm läuft nur, wenn jɭ*/