Talk:Euclidean algorithm/to do
From Wikipedia, the free encyclopedia
Expand the introduction to cover all major aspects. Done LemonteaRegroup the scattered info on the history of this algorithm, and write a history section on it. Done LemonteaAdd detailed description and explanation to the example: it should be more than a table. Done LemonteaBut first we have to format the table better - it looks odd now. Done by Dantheox, thanks!- Expand the implementation codes - the program should handle varies special cases, such as
b bigger than a, negative number, etc. (b>a isn't significant, since in that case, a mod b = a and on the next recursive call, a and b are swapped. Dantheox) (I think the algorithm handles negative numbers by default. Fetofs)
Reorganise (and maybe add a section, if there's enough information) the bits about this algorithm applied to objects other than integers, such as polynomial. Done Dantheox- Cleanup and maybe expand the history section if possible. (Currently it is just a copyedit)
- And obviously, clean up and wikify the introduction.
- and provide a translation of Euclid's algorithm in English, not code (please)
