🚀 go-pugleaf

I am trying to write a program that implements an algorithm to find the two
largest integers out of a row of numbers.
My algorithm should work this way:

The number of elements in the row is a power of 2.

I separate the row in two halves, and then i apply the same algorithm recursivly
to the two new rows.  If I have the two biggest numbers of these new rows, then
i can find the two biggest of the total with maximum 2 comparisons.

The alorithm I implemented so far is located at:

http://users.skynet.be/vandewoestyne/downloads/Searcher.java

and

http://users.skynet.be/vandewoestyne/downloads/BigThings.java

But it seems to have a mistake in it, because this was an example of an
incorrect output I got ('links' = left, 'rechts' = right, 'Grootste waarde =
Biggest value', 'Tweede grootste waarde='second largest value'):

Heaven:~/projecten/ontwerpen02$ java Searcher
78 67 51 15 34 28 31 53 35 50 68 1 33 92 95 13 

links : 78 67 51 15 34 28 31 53 
rechts: 35 50 68 1 33 92 95 13 
links : 78 67 51 15 
rechts: 34 28 31 53 
links : 78 67 
rechts: 51 15 
links : 34 28 
rechts: 31 53 
links : 35 50 68 1 
rechts: 33 92 95 13 
links : 35 50 
rechts: 68 1 
links : 33 92 
rechts: 95 13 
Grootste waarde:        95

Tweede grootste waarde: 78

-- 
Ing. Bart Vandewoestyne			  Bart.Vandewoestyne@skynet.be
Hugo Verrieststraat 48			       GSM: +32 (0)478 397 697
B-8550 Zwevegem					 http://hello.to/MC303
----------------------------------------------------------------------
"Any fool can know, the point is to understand." - Albert Einstein