🚀 go-pugleaf

Bart Vandewoestyne a �crit :
> 
> Andy Zaidman wrote:
> >
> > If you definitly wanted to work recursively...
> 
> Yes, I do.
> 
> > Try the same algo, but return
> > only the biggest value and then reapply the algo to the same list, but with
> > the biggest value removed...
> 
> Hmm... that is not exactly what I want to do...
> The point in my algo is that if I have 4 values, say p1>p2 (found from left
> side) and q1>q2 (found from right side), then i can find the two biggest numbers
> from (left+right) side by:
> 
> if (p1>q1) then {
>         p1 is biggest in (left+right);
>         if (p2>q1) then p2 is second_biggest else q1 is second_biggest
> }
> else {
>         q1 is biggest;
>         if (q2>p1) then q2 is second_biggest else p1 is second_biggest
> }
> 
> This will always result in a maximum of 2 comparisons.
> 
> > Otherwise, just plainly run through the entire
> > list and keep the 2 biggest values in 2 variables...
> 

Hi,

> That is not what I want to do.  I want to implement the recursive algorithm.

Ok, look at a linear algorithm, and if realy you still want to implement a
recursive one, you can still use this example and call it with variable 
search limits.

    final static int MIN = -9999999;

    public static void main(String[] args) 
    {
      int first = MIN;
      int second = MIN;
      int[] list = {78, 67, 51, 15, 34, 28, 31, 53, 35, 50, 68, 1, 33, 92, 95, 13};

      int size = list.length;
      for(int i=0;i<size;i++)
      {
        final int n = list[i];
        if(n>first) {
            second = first;
            first = n;
        }
        else if(n>second)
        {
            second = n;
        }
      }

      System.out.println(first);
      System.out.println(second);
    }

regards,

Marc

_____________________________________________________________________

  L  U  D  O  M  E  D  I  A                   http://www.ludomedia.ch
  -------------------------                 Phone: ++ 41 21 634.80.88
  W E B - S O L U T I O N S                mailto:marnic@ludomedia.ch
_____________________________________________________________________