# Lecture 5: Computing Time Analysis of Basic Arithmetic Algorithms

### Date: Feb. 2

### Background Material and Further Resources

- Review Euclidean algorithm and SACLIB.
- Read the handout below prior to class.

### Reading

- Handout: "Computing Time Analysis of the Euclidean Algorithm"
- Chap. 4 of the text (you may omit the material on the FFT and
Newton's iteration for fast power series inversion.

### Topics

- Go over assignment 4
- Review computing times of basic integer arithmetic algorithms
- Computing time analysis for the Euclidean algorithm applied to
multi-precision integers.
- Computing time analysis for the Extended Euclidean algorithm.

### Maple Worksheet

- tmdinv.mws (contains analysis of two
algorithms for computing modular inversees in Z_p, where p is
a prime BETA-digit).

### SACLIB Programs

### Assignment

Created: Jan. 27, 2000 by
jjohnson@mcs.drexel.edu