Permalink
Commits on Mar 19, 2012
  1. Euler #43

    Evan Farrer committed Mar 19, 2012
  2. Euler #42

    Evan Farrer committed Mar 19, 2012
Commits on Feb 29, 2012
  1. Euler 41

    Simple brute force
    Evan Farrer committed Feb 29, 2012
  2. Euler #40

    Memory is cheap so we may as well just generate the string.
    Evan Farrer committed Feb 29, 2012
  3. Euler #39

    Evan Farrer committed Feb 29, 2012
Commits on Feb 28, 2012
  1. Euler #38

    Normally I've been adding parallelism by creating a parallel foreach loop. This
    time I spawned some worker threads and then had a master thread that tasked up
    the worker threads, in many ways this approach is more elegant.
    Evan Farrer committed Feb 28, 2012
Commits on Feb 27, 2012
  1. cd to the new directory before editing

    Evan Farrer committed Feb 27, 2012
  2. Euler #37

    Evan Farrer committed Feb 27, 2012
Commits on Feb 25, 2012
  1. Euler 36

    Seems to be a test of whether your language can convert numbers to strings and
    whether you can implement isPalinDromic.
    
    Other than that it's quite boring.
    Evan Farrer committed Feb 25, 2012
  2. Refactor Euler003 for weekly golang.

    Evan Farrer committed Feb 25, 2012
  3. Now that we're using the new go command we don't need to worry about …

    ….6 files
    Evan Farrer committed Feb 25, 2012
  4. Allow scripts to record their progress to stderr.

    Evan Farrer committed Feb 25, 2012
  5. Calculate the time in the makefile not in the runProjects.sh script

    That way I get the times even if I run them individually.
    Evan Farrer committed Feb 25, 2012
  6. Euler 35

    Evan Farrer committed Feb 25, 2012
Commits on Feb 17, 2012
  1. Euler #34

    There wasn't anything new to this problem. Just a variant of other problems.
    Boring.
    Evan Farrer committed Feb 17, 2012
  2. Euler #32

    A simple brute force.
    Evan Farrer committed Feb 17, 2012
Commits on Feb 16, 2012
  1. Euler #31

    An important point is that you don't have to actually produce the different
    options but just count them. Also by processing the options in a way that
    guarantees that there will be no duplicates sames memory and CPU. I left the
    recursion as stupid as possible and then have a bunch of base cases at the
    beginning to check for when to stop recursing. That design makes the code really
    simple.
    Evan Farrer committed Feb 16, 2012
  2. Problem # 30

    I could optimize this one but I'm lazy.
    Evan Farrer committed Feb 16, 2012
Commits on Feb 14, 2012
  1. Euler #29

    BigInts are really nice. I think this is the first time I "needed" templates,
    that I found that Go's type system makes it not needed. Go's type system may
    make templates obsolete.
    Evan Farrer committed Feb 14, 2012
Commits on Feb 13, 2012
  1. Euler 28

    The trick is to realize that successive rounds will increase the distance
    between the diagonals by 2. So all we need to do is count from 1 to 1001*1001
    and include the appropriate numbers in the total.
    Evan Farrer committed Feb 13, 2012
  2. Time how long the program runs for

    Evan Farrer committed Feb 13, 2012
  3. Euler #27

    I'm noticing a pattern for using goroutines to improve performance. It seems to
    be easier to just write the code regular and then add the goroutines in later.
    Evan Farrer committed Feb 13, 2012
Commits on Feb 12, 2012
  1. Euler 26

    Took a while to come up with the code for finding duplicating patterns. Probably
    could have saved myself some time if I googled first.
    Evan Farrer committed Feb 12, 2012
Commits on Jan 31, 2012
  1. Euler #25

    Another easy one if you have bigint support.
    Evan Farrer committed Jan 31, 2012
  2. Euler 24

    Kind of a boring one. I just mirrored some python code I found. #apathy.
    Evan Farrer committed Jan 31, 2012
Commits on Jan 17, 2012
  1. Euler #23

    One of the difficulties with using lots of goroutines for a calculation is
    knowing when the calculation is done. In this case I either counted the spawned
    goroutins or in the case where each goroutine would return multiple results I
    had each goroutine return an I'm done message.
    Evan Farrer committed Jan 17, 2012
Commits on Jan 16, 2012
  1. Euler #22

    I guess this was a test to make sure you can split strings and count.
    Evan Farrer committed Jan 16, 2012
Commits on Jan 15, 2012
  1. Euler #21

    This is a prime candidate for parallelization but it's fast enough as it is.
    Evan Farrer committed Jan 15, 2012
  2. Euler #20

    Another simple one due to go's support for BigInt's2
    Evan Farrer committed Jan 15, 2012
  3. Euler #19

    No reason inventing a new date/time method, just use the built in one.
    Evan Farrer committed Jan 15, 2012
Commits on Jan 14, 2012
  1. Euler #18

    Decided to use a smart algorithm that calculated the maximum path to each node
    starting from the top to the bottom. A nodes maximum path is it's value + the
    maximum path of it's parents. This is an O(n) algorithm where n is the number of
    nodes in the triagle/graph.
    Evan Farrer committed Jan 14, 2012