Talk:Extended Euclidean algorithm/to do
From Wikipedia, the free encyclopedia
- Explain and compare the similarity and difference between the two methods of the algorithm(one using double recursion, another using tail recursion;the first one work forward, the second one work backward, so on...)
Wikify(Make it into a table) the equations showing this algorithm in the first example. Done Lemontea- Cleanup the informal formulation section,
explaning the example in more detail. Done Lemontea
Add a proof of correctness section. Not quite needed, afterall, since it's just an extension. LemonteaWikify the pseudocode, bold the keywords like else, return, etc.Done LemonteaReorganise(and refactor, since it's too long now) Cleanup the formal description section. Maybe we can do better in explaning how to find out the x and y in a concise and clear manner.(Use the now deleted Algebraic formulation as a reference)- Have an implementation section with one simple code, and one more complete code.(Not sure whether this is neccessary, depends on how good the pseudocode is)
- Needs links to Linear congruence theorem
- Start a section on the significance of the extension as compared to the original euclidean algorithm(e.g. finding inverses)
- Mention and/or explain (faster) binary version of the algorithm (e.g., The Art of Computer Programming, v. 2, ed. 3, section 4.5.2, exercise 39 — explanation and references in Answers to Excercises)
