Talk:Square root by hand: Difference between revisions
Content added Content deleted
(Pointed out shortcomings of VB.NET version (and others translated from it)) |
m (→Weaknesses of initial VB.NET algorithm: added sig) |
||
| Line 1: | Line 1: | ||
==Weaknesses of initial VB.NET algorithm == |
==Weaknesses of initial VB.NET algorithm == |
||
Just noting where improvements could be made...<br/> |
|||
1. Depends on BigIntegers, which start consuming a considerable amount of memory as the number of digits escalates. |
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. |
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) |
||
Revision as of 20:31, 12 October 2020
Weaknesses of initial VB.NET algorithm
Just noting where improvements could be made...
1. Depends on BigIntegers, which start consuming a considerable amount of memory as the number of digits escalates.
2. Computes and checks 1 to ten "next" digits (average 5?) instead of predicting a guess, then checking it once or twice.--Enter your username (talk) 20:31, 12 October 2020 (UTC)