Tries are tree-like data structures used in applications such as autocomplete and spell checkers. For example, is there a character in the Shahnameh whose name starts with a Z? Well, let’s see.

Go’s container package helps you create heaps, although not as easy as other languages like Python do. But that makes it more fun.

Go’s standard library comes with several sort functions to sort a slice. In this post, I’ll go over some of them to see which one runs faster.