in reply to Re^4: Sorting, recursion, and tail-call optimizations (why? $i)
in thread Sorting, recursion, and tail-call optimizations
Printing $i each time it is assigned shows that when the sort sub is given by name, its value never decreases. When it is wrapped in a sub, it often goes back to zero. I think the problem is in auto-vivifying $_[0].
|
|---|