Algorithms and complexities are by default calculated for the worst case.
FWIW: I just saw a probabilistic approach to prime factorization which is very successful but also very slow in worst case.
But this kind of algorithms play in a different league and are off topic for the task at hand.
Cheers Rolf
(addicted to the Perl Programming Language :)
see Wikisyntax for the Monastery
> This makes a proof more difficult IMHO.
My proof isn't difficult, and once you've seen it it feels "natural"
In reply to Re^2: 1. Go compare! Guardian's algortithm riddle and mathematical proof
by LanX
in thread 1. Go compare! Guardian's algortithm riddle and mathematical proof
by LanX
For: | Use: | ||
& | & | ||
< | < | ||
> | > | ||
[ | [ | ||
] | ] |