Top Stories published by 100 days of algorithms in 2017
January
February
August
September
October
November
December

Day 92: PCA

Principal Component Analysis [PCA] is incredibly useful when you need [among others] to visualise high-dimensional data. It’s also very…


Day 64: K-clique

Clique in an undirected graph is a subgraph that is complete. Particularly, if there is a subset of k vertices that are connected to each other, we say that graph contains a k-clique.


Day 83: Breaking AES

Two months ago I was breaking OTP cipher and today I am going to focus on a more sophisticated mechanism called padding…


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 have to spend your time on.

And since definition of formal languages and grammars is much more complicated than we need at…


Day 1: Hanoi tower

Let’s begin with a simple algorithm, yet, mind-bending if you have never seen it before. Hanoi tower has a beautiful literate solution using recursion.

Just think of it, we need to move the largest disk to right tower, first. For that, we need to move all but this disk…


Day 88: Perlin noise

It has been 35 years since Ken Perlin has discovered a technique today called Perlin noise to generate a fixed gradient…

These were the top 10 stories published by 100 days of algorithms in 2017. You can also dive into monthly archives for 2017 by using the calendar at the top of this page.

About
100 days of algorithms
100 days, 100 algorithms - a challenge consisting of many small pieces
More information
Tags
Editors