Talk:Square root by hand
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)
What is a number?
The task description should be more specific regarding meaning of number. Perhaps including example test cases and output. Presumably the number should not be negative. Should the output include the decimal point when and where appropriate? I'd suggest testing 2, 0.2 and 10.89, with output showing decimal point correctly. With √2 to 480 or 500 decimal places or integers.--Nigel Galloway (talk) 15:38, 14 October 2020 (UTC)