Hi all,

     last year there was a long thread about square roots.  I have
     resurrected Scott's (Dattalo?) routine from way back and modified it
     (parrot fashion) to find the 12bit root of a 24bit number.  I feel it
     is a little profligate in its use of resources, and in fact one could
     write a 32bit routine with probably no more effort.

     Anyway, it uses 61 instructions and takes of the order of 450 cycles
     to execute (my completely random selection of test numbers yielded
     from 409 to 482 cycles).

     It uses 7 registers (and trashes W) and returns the root shifted left
     by 4 bits (a necessary evil).

     Anyone prepared to enter the fray?

     Andy (#2)