The simplest square root algorithm is to simply subtract successive odd numbers and count the number of subtractions:
(9-1=8) (8-3=5) (5-5=0)
Three subtractions so the sq root of nine is 3.

z.B.faktor=2.12345676
maxima: rat(2.12345676);
rat' replaced 2.12345676 by 172/81 = 2.123456790123457
Um mit Faktor zu multiplizieren: *172/81; dividieren: *81/172

unsigned int getint(void) {

unsigned int n=0;char c;
while (((c=getchar())>='0') && (c<='9')) n=10*n+(c-'0');
return n;

}

int machlang[15]={

      0xe3b2, 0x0031,   //xor #-1,&0x31    (emulating INV)
      0x4130            //ret
      };

      int (*machfn)() = NULL;
      machfn= (int (*)()) machlang;
      machfn();