Timeline for Project Euler Problems #1-#5
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 13, 2017 at 12:40 | history | edited | CommunityBot |
replaced http://codereview.stackexchange.com/ with https://codereview.stackexchange.com/
|
|
| Jan 5, 2016 at 23:22 | vote | accept | Der Kommissar | ||
| Dec 18, 2015 at 17:00 | comment | added | holroy | @RobH I don't remember. Don't think so, but solutions tend to look alike fast when they are based on the same algorithm. | |
| Dec 18, 2015 at 10:16 | comment | added | RobH | Did you get the code for Euler 3 from here? mathblog.dk/project-euler-problem-3 your code looks like a straight port to F# of that code. | |
| Dec 7, 2015 at 17:40 | history | edited | holroy | CC BY-SA 3.0 |
Added a non-mutable variant for Euler 5
|
| Dec 7, 2015 at 17:34 | comment | added | Ethan Bierlein |
List.collect and List.map re-generate the sequences based on a rule. While it is more performant to simply just generate a new sequence, it's more of a micro-optimization that makes the code harder to read, and a little less idiomatic.
|
|
| Dec 7, 2015 at 17:06 | comment | added | holroy |
@EthanBierlein, I'm a newbie myself, but if you use List.collect and List.map isn't that kind of building/expanding the lists instead of using the generated sequences? To me the latter seem preferable...
|
|
| Dec 7, 2015 at 16:33 | comment | added | Ethan Bierlein |
While this is a good answer in terms of performance, I'd say that it doesn't really encourage good succinct functional programming. For example, you tell the OP to not use List.collect and List.map, yet this would be the succinct way to functionally program it.
|
|
| Dec 7, 2015 at 8:17 | history | answered | holroy | CC BY-SA 3.0 |