in reply to Re^4: Golf: Tree searching
in thread Golf: Tree searching
By my count this is 53 characters.sub f { $t=pop;$t=$$t{$c>0?l:r}while$c=$$t{d}cmp$_[0]and$t;$t }
|
---|
Replies are listed 'Best First'. | |
---|---|
Re^5: Golf: Tree searching
by tadman (Prior) on Apr 20, 2001 at 08:36 UTC | |
by tilly (Archbishop) on Apr 20, 2001 at 15:18 UTC |