Re: Binary Search
- From: "Stefan Meisner" <stefan.meisner@xxxxxxx>
- Date: Tue, 19 Jun 2007 07:42:31 +0200
You do realize, of course, that it's just an implementation of what Maarten, Dodi, and I suggested,
I didn't read the first thread but this is the implementation I did suggest
initially. So I'll do have a look about the other answers.
The question is whether the hybrid search will outperform an exclusively binary search. I've posted such a search method in another response.
A solution which would search for the very lower and very upper
bounds would be the best solution as it would take much less
comparisions.
Looking at your implementation, this looks fine.
Stefan
.
- References:
- Binary Search
- From: John Dough
- Re: Binary Search
- From: Stefan Meisner
- Re: Binary Search
- From: John Dough
- Re: Binary Search
- From: Maarten Wiltink
- Re: Binary Search
- From: John Dough
- Re: Binary Search
- From: Maarten Wiltink
- Re: Binary Search
- From: John Dough
- Re: Binary Search
- From: John Dough
- Re: Binary Search
- From: Stefan Meisner
- Re: Binary Search
- From: John Dough
- Re: Binary Search
- From: Rob Kennedy
- Binary Search
- Prev by Date: Re: Binary Search
- Next by Date: Re: Binary Search
- Previous by thread: Re: Binary Search
- Next by thread: Re: Binary Search
- Index(es):