Register int32 l = 0Register int32 r = nRegister Int32 m = 0Register int32 f = findwhile (l < r) {	m = (l + r) >> 1	if (a[m] < f)		l = m++;	else		r = m--; // -- needed here, to make sure that it terminates.}if (a[m] == f)	return m;else	return NOT_FOUND;

int *indexchar string[strlen]char find[findlen]char *flen = find[findlen]char *ftoint strl = *string[strlen]index = &string + findlen;while (index < strl) {if (index != fto) {	*Index = &index + findlen;	*fto = &flen    	Continue;} else {    if (&fto > &find) {        *fto = &fto--	Continue;    };    // sucess    return &index - &string    };};};

while (index < strl) {if (index != fto) {	*Index = &index + findlen;	*fto = &flen    	Continue;} else {    if (&fto > &find) {        *fto = &fto--	Continue;    };    // sucess    return &index - &string    };};};

Quote:Original post by Extrarius at 1/2/2005 4:16:16 AM
There is also the sometimes-helpful National Institute of Standards and Technology's Dictionary of Algorithms and Data Structures

Quote:Original post by flangazor at 1/2/2005 7:00:04 PM

Quote:Original post by Flarelocke
Wikipedia also has a nice list.

NIST has some too.

Table() Struct for Elements in table:	Entries()	Struct for elements in entries		Pointer Entry		Integer FullHash	Function hashtableretrieve(key)hsh = hash(key)chsh = hsh modulo Tablesizepointer ctable = pointer to table(chsh).entriesFind hsh, in ctable, using binary search.Return either the entry (pointer), or falure of the search fails.end functionfunction hashtableadd(key, value)h = hashtableretrieve(key)if h is not equal to falure then	return falureend ifhsh = hash(key)chsh = hsh molulo TablesizePointer ctable = pointer to table(chsh).entriesAdd a new element to ctable,	In that elemsnt, make Element.entry equal to value	And Fullhash equal to hshSort ctableend functionfunction hashtableremove(key)hsh = hash(key)chsh = hsh modulo Tablesizepointer ctable = pointer to table(chsh).entriesFind hsh, in ctable, using binary search.Remove the element in which it is found.end function

Quote:Original post by Nice Coder
Imalc: no offence taken. I just usually hand out psudocode that isn't as optimised. Nice code. Too.

Quote:

	if (a[m] < f)		l = m++;	else		r = m--; // -- needed here, to make sure that it terminates.

	if (a[m] < f)		l = m+1;	else		r = m; // -1 NOT needed here, It does terminate!!

Quote:Find hsh, in ctable, using binary search.

//'head' is the binary tree pointer.//'ins' is caller allocated and already contains the data to be inserted.//operator < must be overloaded.template <class TNode>void TreeInsert(TNode *&head, TNode *ins) {	TNode *curr = head;	ins->left = ins->right = NULL;	if (head == NULL) {		head = ins;	} else do {		if (*ins < *curr) {			//it goes somewhere in the left sub-tree			if (curr->left == NULL) {				curr->left = ins;				break;			}			curr = curr->left;		} else {			//it goes somewhere in the right sub-tree			if (curr->right == NULL) {				curr->right = ins;				break;			}			curr = curr->right;		}	} while (true);}

Quote:Original post by Nice Coder
A hash table.

When to use it:
When you need constant time reads/writes.

When not to use it: when your dealing with a small amount of data

Psudocode:

Table() Struct for Elements in table:	Entries()	Struct for elements in entries		Pointer Entry		Integer FullHash	Function hashtableretrieve(key)hsh = hash(key)chsh = hsh modulo Tablesizepointer ctable = pointer to table(chsh).entriesFind hsh, in ctable, using binary search.Return either the entry (pointer), or falure of the search fails.end function