code

[Brian Lewis]

Just to get stuff going on, let's do Project Euler #1.

Whenever we code, please make your solutions as perfect as they can be.
Realize what choices you're making, and have reasons for your decisions.
After you think you've made every byte as good as you know how to make
it, put it on hpaste. Then we can talk strategy, style, naming,
efficiency, etc.

[Brian Lewis]

On Thursday, 14.10.10 at 17:48, Brian Lewis wrote:
> Just to get stuff going on, let's do Project Euler #1.

Be sure your code is the best, and hpaste it, before looking at this.

http://hpaste.org/40583/project_euler_1

[Ian Taylor]

I read Johan Tibell's cufp presentation and thought I'd apply some of that here.
http://github.com/tibbe/cufp-2010

My solutions are here:
http://hpaste.org/40600/project_euler_1

The hpaste has information about running criterion benchmarks.

[Ian Taylor]

Ian, you should think more carefully about problems before solving them.

Less elegant, but direct.

http://hpaste.org/40609/more_like

[Brian Lewis]

Ayyo, anybody else going to give this a try? Should we start talking
about the solutions?

[Francesco Lazzarino]

sorry guys i'll try, i've been really busy all day and all other work days. i'm giving it a try after lunch

On Mon, Oct 18, 2010 at 11:44 AM, Brian Lewis <br...@lorf.org> wrote:

Ayyo, anybody else going to give this a try? Should we start talking
about the solutions?

--
franco

[Christian von Kleist]

Here is my super-crappy code:

http://hpaste.org/40680/pe1

I could only spend a little time on this one. Sorry!

On Thu, Oct 14, 2010 at 5:48 PM, Brian Lewis <br...@lorf.org> wrote:

[Francesco Lazzarino]

http://gist.github.com/634139

BAM!

--
franco

[Francesco Lazzarino]

oops, on hpaste: http://hpaste.org/40710/project_euler_1

--
franco

[Francesco Lazzarino]

#2 http://gist.github.com/634687

--
franco

[Christian von Kleist]

While working on #2, I saw this in the output of my fib function.

[Francesco Lazzarino]

wow, bad-ass

--
franco

[Francesco Lazzarino]

#3 http://gist.github.com/636387

it took me a while to get my algorithm down to a reasonable runtime.

--
franco

[Francesco Lazzarino]

#4 http://gist.github.com/636534

i'm not trying to brown nose by going far ahead, i might not have a change to work on these later so i'm taking advantage of it.

--
franco

[Ian Taylor]

Your #3 has problems for small n.
***Exception: Prelude.maximum: empty list

On Wed, Oct 20, 2010 at 9:24 AM, Francesco Lazzarino

[Francesco Lazzarino]

#5 http://gist.github.com/637306

--
franco

[Francesco Lazzarino]

probably because of this: [2..(n - 1)] (line 10)

On Wed, Oct 20, 2010 at 4:05 PM, Ian Taylor <ibta...@gmail.com> wrote:

--
franco