laziness, impatience, and hubris | |
PerlMonks |
Re^2: Puzzle: The Ham Cheese Sandwich cut.by hv (Prior) |
on Nov 22, 2005 at 13:19 UTC ( [id://510764]=note: print w/replies, xml ) | Need Help?? |
I suspect that a proof of the running time order will concentrate on the expected depth of recursion. However I believe it will be much harder to prove that the push is O(1) - indeed I suspect it is not - and without that the algorithm as a whole cannot be O(n). Hugo
In Section
Meditations
|
|