Euclidean Algorithm: GCD Calculation

Related lectures (27)

Page 2 of 3

Covers the analysis of worst time complexity for algorithms and time complexity with real numbers and integers.

Covers algorithmic complexity and travel time analysis, focusing on measuring the time taken by algorithms and evaluating their performance.

Covers the concept of algorithms, loop invariants, and examples of algorithmic problem-solving.

Covers function composition and integers, including properties and examples.

Introduces integer numbers, well-ordering, induction principles, GCD, LCM, and Bezout's theorem.

Explores practical aspects of solving parity games, including winning strategies, algorithms, complexity, determinism, and heuristic approaches.

Covers Shor's factoring algorithm and the link between order finding and factoring.

Introduces polynomial factorization over finite fields and efficient computation of greatest common divisors of polynomials.

Covers algorithms for big numbers, Z_n, and orders in a group, explaining arithmetic operations and cryptographic concepts.

Explores well ordering, induction, Euclidean division, and prime factorization in integers.