Perfect hashing search
int search( key, r, A ) int key; dataarray r; int *A; { int i; extern int m, m2; i = hashfunction(A[key%m2], key); if( r[i].k == key ) return( i ); else return( -1 ); }
C
source (3316.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 (3316.srch.c) 