The algorithm is simple. Find all local maxima, for some appropriate definition of a maximum (eg, $_[0] < $_[1] > $_[2] might mean that $_[1] qualifies). Sort that list of maxima by value in descending order. Return the first k entries in the list.

so ...

my @values = qw(1 4 3 2 5 6 3 4 2); my @maxima = (); my $k = 2; foreach my $index (1 .. $#values - 1) { push @maxima, $values[$index] if( $values[$index-1] < $values[$index] && $values[$index+1] < $values[$index] ); } # @maxima now contains qw(4 6 4); print join(', ', (sort { $a <=> $b } @maxima)[0 .. $k - 1])."\n";
Finding the indices of the top k maxima is left as a trivial exercise for the reader (hint: push a structure onto @maxima containing the value and index).

In reply to Re: finding local minima/maxima for a discrete array by DrHyde
in thread finding local minima/maxima for a discrete array by Anonymous Monk

Title:
Use:  <p> text here (a paragraph) </p>
and:  <code> code here </code>
to format your post, it's "PerlMonks-approved HTML":



  • Posts are HTML formatted. Put <p> </p> tags around your paragraphs. Put <code> </code> tags around your code and data!
  • Titles consisting of a single word are discouraged, and in most cases are disallowed outright.
  • Read Where should I post X? if you're not absolutely sure you're posting in the right place.
  • Please read these before you post! —
  • Posts may use any of the Perl Monks Approved HTML tags:
    a, abbr, b, big, blockquote, br, caption, center, col, colgroup, dd, del, details, div, dl, dt, em, font, h1, h2, h3, h4, h5, h6, hr, i, ins, li, ol, p, pre, readmore, small, span, spoiler, strike, strong, sub, summary, sup, table, tbody, td, tfoot, th, thead, tr, tt, u, ul, wbr
  • You may need to use entities for some characters, as follows. (Exception: Within code tags, you can put the characters literally.)
            For:     Use:
    & &amp;
    < &lt;
    > &gt;
    [ &#91;
    ] &#93;
  • Link using PerlMonks shortcuts! What shortcuts can I use for linking?
  • See Writeup Formatting Tips and other pages linked from there for more info.