A note on extended Euclid's algorithm
Leung, Hing
Original · EN
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.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.