This is such a cool project.

The benefit also is that you learn binary quickly.

This small article describes nicely what recursion is.

A short run-through of what Big-O notation is and why you need it.

I’ve said this before – you need to have at least an overview of this stuff if you want to make effective programs.

Why is 0.1 + 0.2 != 0.3

This is some very practical use of AI.

This is a good example of the fact: Concurrency is hard.

The tech of Netflix is impressive – at this point I am just waiting for middle-out compression! ??

A short nice article to teach the basics on algorithmic complexity.

There is an important difference!

A very good to-the-point article on how to write a lexer in Go.

This is very cool!

This also explains why you should use bcrypt.

Hashing isn’t enough. Salting is needed. Bcrypt implements this better than you ?

Data generators are so very cool.

This article gives you ALL the info.!

The history and complete set of details of the compression formats and algorithms.