Revision as of 09:14, 7 September 2007 edit SineBot (talk \| contribs) Bots 2,564,908 edits m Automatically signing comment made by Martinwguy ← Previous edit		Revision as of 09:15, 7 September 2007 edit undo Martinwguy (talk \| contribs) Extended confirmed users 617 edits New section: Separate article for integer Square Root algorithms Next edit →
Line 111: The "faster" mul/div-free algorithm is C.C.Woo's book "The Fundamental Operations in Bead Arithmetic", China Lace Co, Hong Kong, adapted to binary. See [http://www.freaknet.org/martin/tape/gos/misc/personal/msc/sqrt/]. A google search for "integer square root algorithm" will turn up a lot of stuff. <small>—Preceding [[Wikipedia:Signatures\|unsigned]] comment added by [[User:Martinwguy\|Martinwguy]] ([[User talk:Martinwguy\|talk]] • [[Special:Contributions/Martinwguy\|contribs]]) 09:12, 7 September 2007 (UTC)</small><!-- Template:Unsigned --> <!--Autosigned by SineBot--> == Separate article for integer Square Root algorithms == Would a separate article be appropriate for integer square root algorithms? There seem to be many of them out there, all very different. [[User:Martinwguy\|Martinwguy]] 09:15, 7 September 2007 (UTC)

Talk:Square root algorithms: Difference between revisions