OK, full disclosure, Tim has a point, the problems get pretty difficult by the time you get to 100 or so. For one of them (#152 I think), my algorithm took over 60 hours to run (doh! But it did give the correct answer - if it hadn't I'd have even less hair than I do!). Once you get the correct answer, you can always find a better/faster/cleaner solution in the forums (fora?). It is quite humbling.
-Joe On Fri, Jul 26, 2013 at 4:05 AM, Tim Brown <tim.br...@cityc.co.uk> wrote: > On 24/07/13 18:29, Joe Gilray wrote: > >> By the time you get to problem #60 you will have built a little toolbox of >> reusable functions (admittedly mostly in the number-theory area) and been >> exposed to many different ways to solve problems and many different >> programming languages. >> > > And by the time you get to problem #100, your head will hurt (but in a fun > kind of way) :-) > > It's well worth checking out the math/number-theory module; there is a > *lot* of cool stuff in there. Only big omission I have found for PE is > that there is no way to prepare a cache of primes. > > Regards, >> -joe >> > > Tim > > > -- > Tim Brown <tim.br...@cityc.co.uk> | City Computing Limited | > T: +44 20 8770 2110 | City House, Sutton Park Road | > F: +44 20 8770 2130 | Sutton, Surrey, SM1 2AE, GB | > ------------------------------**------------------------------** > -----------| > BEAUTY: What's in your eye when you have a bee in your hand | > ------------------------------**------------------------------** > -----------' > City Computing Limited registered in London No. 1767817. > Registered Office: City House, Sutton Park Road, Sutton, Surrey, SM1 2AE > VAT number 372 8290 34. >
____________________ Racket Users list: http://lists.racket-lang.org/users