A note on extended Euclid's algorithm
Discrete Mathematics
2016-07-04 v1
Abstract
Starting with the recursive extended Euclid's algorithm, we apply a systematic approach using matrix notation to transform it into an iterative algorithm. The partial correctness proof derived from the transformation turns out to be very elegant, and easy to follow. The paper provides a connection between recursive and iterative versions of extended Euclid's algorithm.
Cite
@article{arxiv.1607.00106,
title = {A note on extended Euclid's algorithm},
author = {Hing Leung},
journal= {arXiv preprint arXiv:1607.00106},
year = {2016}
}