There are only two hard things in computer science: cache invalidation, naming things, and off-by-one errors.
Quite frequently I got asked programming questions like these ones:
“Which algorithm should I use to count all possible combinations for a given number of dice.”
As we start moving away from trivial programs, we need a way to split our code into multiple files. Of course, Go does support this feature, but not in the same way as .NET does.
I’m going to take a hiatus from algorithms and data structures in Ruby to write about my experiences while learning Go after more than a decade of .NET.
If you are an experienced .NET developer who happens to need to learn Go in no-time…