(12C) Square Root

[Gamo]

Thanks Albert Chan
Very interesting article.

I have streamline this program a bit, now no counter, with an educated guess,
program will take on average less than 5 iterations.
This program update included Pause to observe each iterations until converge to an answer.

Program:

Code:


01 STO 2
02 R↓
03 STO 1
04 RCL 1
05 RCL 2
06  ÷
07 LSTx
08  +
09  2
10  ÷
11 PSE
12 STO 3
13 RCL 2
14  -
15 LSTx
16  ÷
17  0
18 X<>Y
19 X≤Y
20 CHS
21 EEX
22 CHS
23  8
24 X<>Y
25 X≤Y
26 GTO 30
27 RCL 3
28 STO 2
29 GTO 04
30 RCL 3

Hints:
Program line 17 to 20 is the [ABS] function with this routine we avoid using n [ENTER] [x] [√x] because
it is kind of funny to use [√x] in program while this program is looking for the Square Root.
This [ABS] function routine is also work good on HP-10C I have post earlier here

https://www.hpmuseum.org/forum/thread-12138.html

Gamo