John,

There is no way that coding a binary search tree algorithm in VFP code is going to be faster than using the native index tag which is B+Tree based. This is mostly because of the interpretive code execution. It may be possible using a C++ DLL but I seriously doubt that it would be faster.

>Hi,
> Regard to the binary search for text file and FP database, I need more confirmation, senario, case study and experience from u all to justify the VFP database engine is the faster than search record from text file.
> Pls kindly send me, tell me ur experience with this issues....thank you