It gets correct answers, works fine with random numbers (as long as they are all non-negative), is linear in memory consumption and the running time is O(N*log(N)).
In reply to Re: Re: Puzzle: need a more general algorithm
by Anonymous Monk
in thread Puzzle: need a more general algorithm
by Ovid
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |