|
<![CDATA[
int search( key, r )
typekey key; dataarray r;
{ extern int n;
int i;
datarecord tempr;
for ( i=0; i<n-1 && r[i].k != key; i++ );
if ( key == r[i].k ) {
if ( i>0 ) {
/*** Transpose with predecessor ***/
tempr = r[i];
r[i] = r[i-1];
r[--i] = tempr;
};
return( i ); /*** found(r[i]) ***/
}
else return( -1 ); /*** notfound(key) ***/
}
]]> |
![[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 (313.srch.c) 