<?xml version="1.0" encoding="UTF-8"?>
<commit>
  <added type="array">
    <added>
      <filename>euler/euler014.hs</filename>
    </added>
  </added>
  <modified type="array"/>
  <removed type="array"/>
  <parents type="array">
    <parent>
      <id>877d83e622ab4371bdf7f0aceee676937b501fb5</id>
    </parent>
  </parents>
  <author>
    <name>Vineet Kumar</name>
    <email>vineet@doorstop.net</email>
  </author>
  <url>http://github.com/vin/challenge/commit/8862b2e587ced8cc90e9fcb0d626b60f59215f48</url>
  <id>8862b2e587ced8cc90e9fcb0d626b60f59215f48</id>
  <committed-date>2009-01-04T12:16:45-08:00</committed-date>
  <authored-date>2009-01-04T12:16:45-08:00</authored-date>
  <message>add a solution for euler problem 14 (collatz).

There are a few different approaches here:

the naive using maximumBy (comparing.length.collatz)
 -&gt; stack overflow

same thing using a custom maximumBy', which uses foldl', for strict evaluation
 -&gt; runs, but takes 100s

using snd . max (length &amp;&amp;&amp; id) -&gt; runs in 12s, but I don't really understand
why this is so much better than the above.</message>
  <tree>adb9b494fd8f98f62d1d18c06088d1e6f8e5f1b6</tree>
  <committer>
    <name>Vineet Kumar</name>
    <email>vineet@doorstop.net</email>
  </committer>
</commit>
