Algorithms

General

• List of Algorithms from Wikiwand – Long list of algorithms, some well-known, others not so much.
• Christopher Koutschan. The Most Important Algorithms (Survey).
  • A very subjective but still helpful survey of the most important algorithms. Findings are: A* search, Beam Search, Binary Search, Branch and Bound, Buchberger’s, Data Compression (Source Coding), Diffie-Hellman Key Exchange, Djikstra’s, Discrete Differentiation, Dynamic Programming, Euclidean, Expectation-Maximization (EM-Training), Fast Fourier Transform (FFT), Gradient Descent, Hashing, Heaps (Heap Sort), Karatsuba Multiplication, LLL, Maximum Flow, Merge Sort, Newton’s Method, Q-learning, Quadratic Sieve, RANSAC, RSA, Schongae-Strassen, Simplex, Singlar Value Decomposition (SVD), solving a system of linear equations, Strukturtensor, Union-find, Viterbi. See article for brief description of each.

Asymptotic Notation

• See the Cambridge dictionary for audio pronunciations of the word asymptotic.
• Thomas Cormen, Davin Balkcom. Asymptotic Notation. Khan Academy.
  • Big-Theta Notation.

Graph Traversal

• Estefania Cassingena Navone. Dijkstra’s Shortest Path Algorithm – Detailed and Visual Introduction. freecodecamp, 2020.

Tree Traversal

Reverse Polish Notation

Big O Notation

Searching

Linear

Binary

• Estefania Cassingena Navone. Binary Search in Python: A Visual Introduction. freecodecamp, 2020.

Interpolation

Hash Table

Sorting

Bubble Sort

• Clark Jason Ngo, freecodecamp, 2019.

Insertion Sort

• Sanjula Madurapperuma, freecodecamp, 2019.

Selection Sort

Merge Sort

Quick Sort

Timsort

• Safia Abdalla, dev.to, 2020.

Inserting

Updating

Deleting

Optimization

Greedy

Divide and Conquer