Extended Euclidean algorithm: Examples & Code
Extended Euclidean algorithm: Find gcd(a,b) and signed coefficients x,y satisfying ax + by = gcd(a,b). Explore a worked example, complexity and tested code.
Explore algorithm visualizations code snippets and tutorials
Extended Euclidean algorithm: Find gcd(a,b) and signed coefficients x,y satisfying ax + by = gcd(a,b). Explore a worked example, complexity and tested code.
Minimum palindrome partition cuts: Build palindrome intervals and minimum prefix cuts, then reconstruct a partition. Explore a worked example, complexity and…
Egg dropping (moves formulation): Track the maximum number of floors distinguishable with each egg count and number of drops. Explore a worked example,…
Weighted interval scheduling: Sort by finish time, then choose compatible jobs with maximum total value. Reconstruct the selected original job indices.…
Matrix-chain multiplication: Choose multiplication order with minimum scalar multiplications and reconstruct the parenthesization. Explore a worked example,…