Coalesced hashing: search
int search( key, r ) typekey key; dataarray r; { int i; i = hashfunction( key ); while ( i!=(-1) && !empty(r[i]) && r[i].k!=key ) i = r[i].next; if ( i==(-1) || empty(r[i]) ) return( -1 ); else return( i ); }
C
source (3312.srch.c)
©
Addison-Wesley
Publishing Co. Inc.
![[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 (3312.srch.c) 