DSA
Reference algorithms worth knowing by name: the Euclidean algorithm, Huffman coding, and the traveling salesman problem.
Named after the ancient Greek mathematician Euclid, the Euclidean algorithm is the oldest known non-trivial algorithm, described in Euclid's famous book "Elements" from 300 BCE.
Huffman Coding is an algorithm used for lossless data compression.
The Traveling Salesman Problem states that you are a salesperson and you must visit a number of cities or towns.
The 0/1 Knapsack Problem states that you have a backpack with a weight limit, and you are in a room full of treasures, each treasure with a value and a weight.
Memoization is a technique where results are stored to avoid doing the same computations many times.
Tabulation is a technique used to solve problems.
Dynamic Programming is a method for designing algorithms.
A greedy algorithm decides what to do in each step, only based on the current situation, without a thought of how the total problem looks like.