|
<![CDATA[
sort( r, lo, up )
ArrayToSort r;
int lo, up;
{int i, j;
while (up>lo) {
j = lo;
for ( i=lo; i<up; i++ )
if ( r[i].k > r[i+1].k ) {
exchange( r, i, i+1 );
j = i;}
up = j;
for ( i=up; i>lo; i-- )
if ( r[i].k < r[i-1].k ) {
exchange( r, i, i-1 );
j = i;}
lo = j;
}
}
]]> |
![[Home]](../../images/home_g.gif)
![[Contents]](../../images/contents_g.gif)
![[Chapter]](../../images/chapter_g.gif)
![[Previous Algorithm]](../../images/prevalg_g.gif)
![[Next Algorithm]](../../images/nextalg_g.gif)
C source (411b.sort.c) 