# User talk:Lisp

### From HaskellWiki

(Difference between revisions)

(I think it's better to not hard code the triangle numbers) |
(stop damaging Euler problems) |
||

Line 3: | Line 3: | ||

:triangleNumbers = scanl1 (+) [1..] | :triangleNumbers = scanl1 (+) [1..] | ||

There's no performance advantage to the hard coded list, and it limits the problem size to just the numbers you included. How do you know how many you need before hand? [[User:Quale|Quale]] 17:52, 18 February 2008 (UTC) | There's no performance advantage to the hard coded list, and it limits the problem size to just the numbers you included. How do you know how many you need before hand? [[User:Quale|Quale]] 17:52, 18 February 2008 (UTC) | ||

+ | |||

+ | ==[[Euler problems]]== | ||

+ | Please don't remove valid solutions to the problems, and certainly don't replace them with references to the OEIS. [[User:Quale|Quale]] 17:25, 25 February 2008 (UTC) |

## Latest revision as of 17:25, 25 February 2008

## [edit] 1 Euler problems/11 to 20

Do you think it's better to replace the simple generation of triangle numbers with a hard coded list? I think it was better before with

- triangleNumbers = scanl1 (+) [1..]

There's no performance advantage to the hard coded list, and it limits the problem size to just the numbers you included. How do you know how many you need before hand? Quale 17:52, 18 February 2008 (UTC)

## [edit] 2 Euler problems

Please don't remove valid solutions to the problems, and certainly don't replace them with references to the OEIS. Quale 17:25, 25 February 2008 (UTC)