comp.lang.idl-pvwave archive: archive » Array searching efficiency

Home » Public Forums » archive » Array searching efficiency

Show: Today's Messages :: Show Polls :: Message Navigator
E-mail to friend

Re: Array searching efficiency [message #75048 is a reply to message #74959]

Fri, 11 February 2011 07:35

pgrigis
Messages: 436
Registered: September 2007

Senior Member

On Feb 10, 7:47 pm, Matt Francis <mattjamesfran...@gmail.com> wrote:
> On Feb 11, 11:44 am, Matt Francis <mattjamesfran...@gmail.com> wrote:
>
>>> I would shocked if it wasn't several orders of magnitude faster
>>> (for this many iterations) to Histogram your times array with some
>>> appropriate bin size and then ask "which bin" your time_now
>>> was in with Value_Locate.
>
>> Thanks David, VALUE_LOCATE is exactly the function I'm looking for.
>
> Thanks also to Paulo, who ninja'd my previous post.

As a general comment, from a basic algorithmic point of view,
finding one element in a sorted array is a log(N) kind of problem.

An example of an algorithm that does this is bisection:
go to the middle of the array - check if the wanted item
is left or right, then go to the middle of that side, check
in which quarter the element is, rinse and repeat.

Ciao,
Paolo

Report message to a moderator

[Message index]

		Array searching efficiency By: Matt Francis on Thu, 10 February 2011 15:47
		Re: Array searching efficiency By: pgrigis on Fri, 11 February 2011 07:35
		Re: Array searching efficiency By: Matt Francis on Thu, 10 February 2011 16:47
		Re: Array searching efficiency By: Matt Francis on Thu, 10 February 2011 16:44
		Re: Array searching efficiency By: penteado on Thu, 10 February 2011 16:32
		Re: Array searching efficiency By: David Fanning on Thu, 10 February 2011 16:03

Previous Topic:	reading and writing very slow
Next Topic:	possible bug with center keyword option for FFT

-=] Back to Top [=-

[ Syndicate this forum (XML) ] [

] [

]

Current Time: Fri Oct 10 12:48:28 PDT 2025

Total time taken to generate the page: 0.71826 seconds