[Home]
[Contents]
[Chapter]
[Previous Algorithm]
[Next Algorithm]

Insertion in a sorted array (Pascal version available)


void insert( new, r ) typekey new; dataarray r; { extern int n; int i; if ( n>=m ) Error /*** table is full ***/; else { for ( i=n++; i>=0 && r[i].k>new; i-- ) r[i+1] = r[i]; r[i+1].k = new; } }

C source (321.ins.c) Pascal source (321.ins.p)


© Addison-Wesley Publishing Co. Inc.