This project attempts to document the algorithm discovery and optimisation phases carried out while solving Project Euler mathematical problems programmatically. Its purpose is not to document the best algorithms or solutions but to document the progression from brute force solutions to better and better algorithms.
Each commit will show progression of some sort, adding a new solution or optimising an existing solution. It's very interesting to see how the algorithms transform.
There are 4 implementations for each problem:
- BruteForce
- Linq
- Optimised
- ProjectEuler
Each implement ISolutions.
The solutions can be ran from the test project. There is a test class for each of the 4 implementations.
Here are naive and brute force solutions. It is interesting to see how the algorithms change as they are optimised so I have kept the brute force versions here for comparison and learning.
The other solutions cannot leverage Linq. These solutions can use Linq.
These solutions are optimised. I tried to optimise as well as I could without cheating by getting help from the internet. If I look something up I will document it.
These solutions are a C# implementation of the answers that Project Euler provides once you complete a problem. Used to compare with my own optimised solutions.