INSERTION SORT

TRACING INSERTION SORT

SIMPLE INSERTION SORT

Metode pengurutan

Void insert sort ( int x[], int n)

{

int i,k,y;

for( k=1; k

{

y = x[];

for ( i = k-1; i>=0&&y

x [i+1] = x [i];

x[i+1] = y;

}

}





Soal: SORTING 18 9 8 28 3 2

Dengan INSERTION SORT

TRACING

n= 6