Hi Brian, There is a page in Wikibooks about Algorithm Implementation for Binary search: http://en.wikibooks.org/wiki/Algorithm_implementation/Search/Binary_search
Would you like to add your example under a new revTalk section? By the way, i find enlightening the facts exposed in the Wikipedia article about "Binary Search": http://en.wikipedia.org/wiki/Binary_search_algorithm "When Jon Bentley assigned it as a problem in a course for professional programmers, he found that an astounding ninety percent failed to code a binary search correctly after several hours of working on it[3], and another study shows that accurate code for it is only found in five out of twenty textbooks (Kruse, 1999). Furthermore, Bentley's own implementation of binary search, published in his 1986 book Programming Pearls, contains an error that remained undetected for over twenty years.[4]" Undetected for Twenty years! Scary to say the least... :-( al Brian Yennie wrote: > > Here is a quick example of what binary search can do. It's a bit of > work to maintain the sorted data, but the speed is impressive if you > have very large data. > [snip] > -- View this message in context: http://www.nabble.com/-script-optimization-challenge--Multi-dimensional-array-filtering-tp24826774p24911591.html Sent from the Revolution - User mailing list archive at Nabble.com. _______________________________________________ use-revolution mailing list [email protected] Please visit this url to subscribe, unsubscribe and manage your subscription preferences: http://lists.runrev.com/mailman/listinfo/use-revolution
