|
|
|
| Syntactic Confectionery Delight | |
| PerlMonks |
Re^5: Puzzle: The Ham Cheese Sandwich cut.by robin (Chaplain) |
| on Nov 21, 2005 at 19:39 UTC ( #510542=note: print w/replies, xml ) | Need Help?? |
|
In fact I'm wrong in any case. A naive recursive call seems to be just a hair faster than the goto, even when finding the median of a million-element list.
As you suggest, the fastest of all is to simply call the sub with an ampersand, but really the difference is very small. I wonder whether this is running into unshift's worst-case performance. Premature optimization and all that…
In Section
Meditations
|
|
||||||||||||||||||||||||