Re: binary search

From: Marc Dansereau <bouloumag@xxxxxxxxxxx>
Date: Wed, 27 Jul 2005 21:54:41 -0400

JD wrote:

> Given a sorted linked list it is required to perform a binary search
> for a particular element. Kindly suggest an optimum algorithm for the
> problem.

Binary search is not a practical solution for linked list. Mabe you can
search google for skip list wich is probably a better solution.
.

Follow-Ups:
- Re: binary search
  - From: Scott Moore

References:
- binary search
  - From: JD

Prev by Date: Re: Are programmers like this in the real world?
Next by Date: Re: programming job market in bay area in US
Previous by thread: Re: binary search
Next by thread: Re: binary search
Index(es):
- Date
- Thread

Relevant Pages

Re: binary search
... Kindly suggest an optimum algorithm for the ... Binary search doesn't apply to linked lists. ... Prev by Date: ...
(comp.programming)
Re: binary search
... >> Binary search is not a practical solution for linked list. ... Allocate an array of pointers with the same number of units ... Place a pointer to each element of the list in the array. ...
(comp.programming)
Re: binary search
... > Binary search is not a practical solution for linked list. ... Allocate an array of pointers with the same number of units ... Place a pointer to each element of the list in the array. ...
(comp.programming)
Re: binary search
... > Given a sorted linked list it is required to perform a binary search ... bunch of arbitrary memory locations hooked together with pointers. ... store the first item "as is". ... Prev by Date: ...
(comp.programming)
Re: binary search
... > Given a sorted linked list it is required to perform a binary search ... > Kindly suggest an optimum algorithm for the ... More useful might be an AVL or other balanced tree solution for ...
(comp.programming)