Advanced Algorithms Analysis and Design - Lecture 39: Number theoretic algorithms (Theorems and algorithms). In this lecture we will cover the following: some more proofs; GCD as a linear combination; finding GCD, a recursive theorem; Euclid’s algorithm; extended Euclid’s algorithm; time complexity of Euclid’s algorithm; . |