Talk:Square root by hand

From Rosetta Code

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)

At heart, it appears to be the same algorithm as my Phix entry, just "de-generalised". --Pete Lomax (talk) 23:45, 12 October 2020 (UTC)