Come for the quick hacks, stay for the epiphanies. | |
PerlMonks |
Re^3: Finding the max()/min()by Ven'Tatsu (Deacon) |
on Nov 11, 2004 at 22:02 UTC ( [id://407198]=note: print w/replies, xml ) | Need Help?? |
Your solution is calling max(@xs) twice each step. This leads to O(2^n) growth for what should be an O(n) problem. Modifying it slightly to call max once and save the value in a temp variable should save considerable time on long lists.
In Section
Meditations
|
|