Re: Avoiding a for cicle

[landsman(at)my-deja.com]

In article <B51278FB.4C3D%zamb@physics.ucla.edu>,
  Ricardo Fonseca <zamb@physics.ucla.edu> wrote:
> Hi
>
> I'm looking for a more efficient way of implementing the following
(i.e.
> avoiding the for cycle) which is a routine for finding local maximuns
>
> ; Data is a 1D Array
>
> s = Size(Data)
>
> nx = s[1]
>
> max_pos = [-1]
>
> for i = 1, nx-1 do $
>    if ((Data[i] gt Data[i-1]) and (Data[i] gt Data[i+1])) then $
>        max_pos = [[max_pos],i]
>
> ; and then throw away the first element...
>
> Any ideas? Thanks in advance, Ricardo
>

And JD Smith gave the solution:

>max_pos = where(data gt median(data,3))

Cool!    I think this can be described as an almost literal example of
"thinking outside of the box"

Wayne Landsman                     landsman@mpb.gsfc.nasa.gov


Sent via Deja.com http://www.deja.com/
Before you buy.