On Wed, 05 Nov 2008, Mindaugas Kavaliauskas wrote: Hi Mindaugas,
> does b-tree have a big advantage over simple binary search in case all data > is IN MEMORY. I see no advantage in data lookup. There is advantage in data > insertion in case of large number of keys. Exactly and this is the only one reason. The question is if it's important enough to invest time for it ;-) Best regards, Przemek _______________________________________________ Harbour mailing list [email protected] http://lists.harbour-project.org/mailman/listinfo/harbour
