I wrote the first algorithm on March 25. I wrote the last one today, on July 2. 100 days, 100 algorithms, 100 articles.
Many thanks to everyone of you for your support. You have helped me with this series more than you might think.
For the 100th algorithm I chose a segmented Eratosthenes sieve for primes up to 10⁹…
Linear programming is an area of mathematics that deals with the simplest form of constrained optimization problem — linear program. And simplex should definitely be in your toolbox if you are serious about algorithms.
Romberg’s method to find a definite integral combines two formulas, extended trapezoidal rule and Richardson extrapolation, to get a good approximation in relatively low number of steps.
Locally weighted regression is a very powerful non-parametric model used in statistical learning.
Floyd-Steinberg dithering is a truly magical technique. It is supposed to fool your eye and brain to make you think…
We say that two nodes U and V in a directed graph belong to the same strongly connected…
Yesterday I have implemented an algorithm that directly relates to an implementation of parser for formal grammars. Today I have implemented the parser itself.
However, I have no use for yesterday’s work since the parser is not SLR [as you might have expected]…
If you plan to implement own parser for a context-free grammar, construction of FIRST and FOLLOW sets will be the first algorithm you will have to spend your time on.
And since definition of formal languages and grammars is much more complicated than we need at…
Principal Component Analysis [PCA] is incredibly useful when you need [among others] to visualise high-dimensional data. It’s also very…