the best way to binary search is to use the C provided library, best because

simplest.

I can't recall what's the name, something like search/find, bsearch....

whatever

yes, it's limited, but 99% it'll work.

the binary search is such a piece of cake to do, that you might as well

doing by yourself.

binary search = also dictionary search, that is calculate the middle element

and compare to your item...

if greater consuider now the second half and redivide otherwise consider the

first half.

it's a logarithmic response it's the best BUT............. how do you have

items inserted ????

consider learning what a Btree is and it's balancing, btree is ideally just

as fast when it comes to searching, because it still goes left/right

dividing each time ......... but it's also immensly fast in inserting

items....

"Gordon Knote" <an*******@discussions.microsoft.com> wrote in message

news:77**********************************@microsof t.com...

Hi,

can anyone tell me what's the best way to search in binary content? Best
if someone could post or link me to some source code (in C/C++). The search should be as fast as possible and it would be great if the
engine (or so) would accept multiple parameters (like a search offset, a max

number of bytes to search in etc.).

Any ideas?

Thanks a lot again,

Gordon