OpenEuphoria

Re: Sequence Slicing (Was RE: Tough ciphers?)

• Posted by Mike Nelson <MichaelANelson at WORLDNET.ATT.NET> Mar 16, 2002
• 384 views

Chris' results with range_find() are comparable to bechmarks from a while
ago about a binary searcj routine vs. find on a sorted sequence--the break
even point is about 300 for sequence data and about 500 for integer data.

For the specific case of finding the last element of a sequence of 10,000
strings, the benchmark varies quite a bit based on how different the
non-matching strings are from the search string: the fastest times are when
the other strings are a different length, the next fastest when the first
character is different, then when the second character is different, etc.

--Mike Nelson