Thursday, January 29, 2015

Project Euler, Part II

As I said in my first Project Euler post, my goal would be not to just develop a correct solution to each problem, but one with the absolute minimum possible run-time cost. Well, the absolute minimum time for anything is zero.

But before I get to that:

After doing the first problem, I had a dilemma. The Project Euler web site asks that people not post the correct answer (or their solution), so that others may enjoy the challenge (paraphrasing). While on the one hand I understand (and respect) their request, on the other hand there are entire sites dedicated to publishing solutions and answers for Project Euler problems.

In the end, I decided the cat was already out of the bag, so I'll be posting my solutions. If someone genuinely wants to solve a given Project Euler problem on their own, they won't just google for the answer anyway. I will be prefacing each post that contains a solution to a Project Euler problem with a spoiler alert notice, so anyone actually working through the problems on their own shouldn't have anything ruined for them.

All that being said, I'll reiterate that the theoretical minimum run-time for anything is zero. So that's the goal: a zero-run-time solution to each problem from Project Euler.

Welcome to Euler Zero. Posts will be labeled accordingly.