Resources đ
- DSA Tutorial - Learn Data Structures and Algorithms
- Structure and Interpretation of Computer Programs (1996) by Harold Abelson and Gerald Jay Sussman with Julie Sussman
- rushter/MLAlgorithms - Minimal and clean examples of machine learning algorithms implementations
Algorithms & Data Structures
- Primâs algorithm - Wikipedia
- Trie - Wikipedia
- Binary search tree - Wikipedia
- K-D Trees
- Double-ended queue - Wikipedia
- Deques are a generalization of stacks and queues (the name is pronounced âdeckâ and is short for âdouble-ended queueâ). Deques support thread-safe, memory efficient appends and pops from either side of the deque with approximately the same O(1) performance in either direction. â Python docs for
collections.deque
- Deques are a generalization of stacks and queues (the name is pronounced âdeckâ and is short for âdouble-ended queueâ). Deques support thread-safe, memory efficient appends and pops from either side of the deque with approximately the same O(1) performance in either direction. â Python docs for
- FloydâWarshall algorithm - Wikipedia
- Run-length encoding - Wikipedia
- Fun (weird?)
- Sorting
- How to sort? by Michel Goemans â MIT Math 18.310 (March 28, 2015)
- Floating Point
- Sieve of Eratosthenes - Wikipedia