Homepage
Open in app
Sign inGet started

100 days of algorithms

End of Line.

I wrote the first algorithm on March 25. I wrote the last one today, on July 2. 100 days, 100 algorithms, 100 articles.
Go to the profile of Tomáš Bouda
Tomáš Bouda
Jul 2, 2017
Day 100: Segmented Eratosthenes sieve

Day 100: Segmented Eratosthenes sieve

For the 100th algorithm I chose a segmented Eratosthenes sieve for primes up to 10⁹ implemented in Cython. And this time the goal is to…
Go to the profile of Tomáš Bouda
Tomáš Bouda
Jul 2, 2017

Day 99: Simplex

Linear programming is an area of mathematics that deals with the simplest form of constrained optimization problem — linear program. And…
Go to the profile of Tomáš Bouda
Tomáš Bouda
Jul 1, 2017
Day 98: Romberg integration

Day 98: Romberg integration

Romberg’s method to find a definite integral combines two formulas, extended trapezoidal rule and Richardson extrapolation, to get a good…
Go to the profile of Tomáš Bouda
Tomáš Bouda
Jun 30, 2017
Day 97: Locally weighted regression

Day 97: Locally weighted regression

Locally weighted regression is a very powerful non-parametric model used in statistical learning.
Go to the profile of Tomáš Bouda
Tomáš Bouda
Jun 29, 2017
Day 96: Floyd-Steinberg

Day 96: Floyd-Steinberg

Floyd-Steinberg dithering is a truly magical technique. It is supposed to fool your eye and brain to make you think that you see more than…
Go to the profile of Tomáš Bouda
Tomáš Bouda
Jun 28, 2017
Day 95: Strongly connected components

Day 95: Strongly connected components

We say that two nodes U and V in a directed graph belong to the same strongly connected component [SCC], if there exists path from U to V…
Go to the profile of Tomáš Bouda
Tomáš Bouda
Jun 27, 2017
Day 94: Earley parser

Day 94: Earley parser

Yesterday I have implemented an algorithm that directly relates to an implementation of parser for formal grammars. Today I have…
Go to the profile of Tomáš Bouda
Tomáš Bouda
Jun 26, 2017

Day 93: FIRST & FOLLOW

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…
Go to the profile of Tomáš Bouda
Tomáš Bouda
Jun 25, 2017
Day 92: PCA

Day 92: PCA

Principal Component Analysis [PCA] is incredibly useful when you need [among others] to visualise high-dimensional data. It’s also very…
Go to the profile of Tomáš Bouda
Tomáš Bouda
Jun 24, 2017
About 100 days of algorithmsLatest StoriesArchiveAbout MediumTermsPrivacy