- Algorithms
- Recursion
- Call Stack
- Iterative Approach
- Memoization
- Head Tail
- Data Structures
- Arrays, Sets
- Time Complexity
- Hash Tables
- Stacks
- Queues
- Linked Lists
- Binary Search Trees
- Tries
- Graphs
- Divide Conquer
- Binary Search
- Quicksort
- Merge Sort
- Karatsuba Multiplication ♣
- Graph Traversal
- Flood Fill
- Depth First Search
- Breadth First Search
- Dijkstra's Algorithm
- Decision Making
- Minimax
Algorithms
Machine Learning
Divide Conquer / Karatsuba Multiplication »
First multiplication algorithm faster than the quadratic algorithm. It reduces the multiplication of 2 n-digit numbers to 2 multiplications of n/2-digit Karatsuba used a precomputed table of products for single digits numbers.
What makes Karatsuba multiplication special? Why is faster that the classic quadractic algorithm? What cache table did Karatsuba used?
Click to Flip Card
