kota's memex

big o notation

Simplified analysis of an algorithms efficiency.

sorting

https://en.wikipedia.org/wiki/Sorting_algorithm https://www.toptal.com/developers/sorting-algorithms

misc

https://en.wikipedia.org/wiki/Sieve_of_Eratosthenes

An ancient algorithm for finding all prime numbers up to any given limit.

https://en.wikipedia.org/wiki/Exponential_backoff

Useful for retrying a network connection over a certain amount of time.

learn

https://github.com/TheAlgorithms/Go

Big repo of popular algorithms implemented in go so you can read how they work.

https://algorithmswithgo.com/

Guide for various algorithms with go.

https://en.wikipedia.org/wiki/Introduction_to_Algorithms

CLRS is definitely the most widely used and studied algorithms book. It's a bit math heavy, but not too bad. Each chapter covers an algorithm and how to use it with pseudocode examples.