Revision as of 21:07, 15 August 2009 edit DanielPharos (talk \| contribs) Extended confirmed users 8,696 edits Speedy merge! ← Previous edit		Revision as of 21:18, 15 August 2009 edit undo Rankiri (talk \| contribs) 2,397 edits No edit summary Next edit →
Line 13: '''Delete''' C++ program to implement standard algorithm with poorly thought out implementation (what happens if the argument is negative? what if the last digit of the floating point fluctuates (unlikely but not impossible, since it depends on the implemenation of floating point division)?) We are not a how-to. [[User:Pmanderson\|Septentrionalis]] <small>[[User talk:Pmanderson\|PMAnderson]]</small> 17:08, 14 August 2009 (UTC) '''Speedy merge''' Isn't this just the same as [[Methods of computing square roots#Babylonian method\|the Babylonian method]]? --[[User:DanielPharos\|DanielPharos]] ([[User talk:DanielPharos\|talk]]) 21:07, 15 August 2009 (UTC) :*What's so speedy about it? And you can't just merge unreferenced [[WP:OR\|original research]] into another article. — [[User:Rankiri\|Rankiri]] ([[User talk:Rankiri\|talk]]) 21:18, 15 August 2009 (UTC)

Wikipedia:Articles for deletion/Near Root Algorithm: Difference between revisions