Talk:Square root by hand: Difference between revisions
→Weaknesses of initial VB.NET algorithm
m (→Weaknesses of initial VB.NET algorithm: added sig) |
|||
Line 3:
1. Depends on BigIntegers, which start consuming a considerable amount of memory as the number of digits escalates.<br/>
2. Computes and checks 1 to ten "next" digits (average 5?) instead of predicting a guess, then checking it once or twice.--[[User:Enter your username|Enter your username]] ([[User talk:Enter your username|talk]]) 20:31, 12 October 2020 (UTC)
:At heart, it appears to be the same algorithm as my Phix entry, just "de-generalised". --[[User:Petelomax|Pete Lomax]] ([[User talk:Petelomax|talk]]) 23:45, 12 October 2020 (UTC)
| |||