David Neto's CSC364 page
Updated October 9, 1996
New (October 9, 1996):
Added Ideal Turing code and Scheme code for fast exponentiation.
This term, fall 1996,
I'm a teaching assistant for CSC364, Computability and Complexity, at
the Department of Computer Science
at the University of Toronto. This course is being taught by
You should probably be visiting the
CSC364 Home page instead of this page.
Here's some Scheme code and Ideal Turing code
for quickly computing a^b mod n.
I've included a quick runtime analysis as well.
Back to David Neto's teaching page
Back to David Neto's home page