Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!swrinde!zaphod.mps.ohio-state.edu!samsung!munnari.oz.au!metro!cluster!ultima!fidogate
From: robbie.matthews@f1701.n7802.fido.oz.au (Robbie Matthews)
Newsgroups: comp.lang.c
Subject: RE: # TO THE NTH POWER
Message-ID: <18729@ultima.socs.uts.edu.au>
Date: 15 Nov 90 22:29:24 GMT
Sender: fido@ultima.socs.uts.edu.au
Organization: A Fidonet node, gated through ultima.socs.uts.edu.au
Lines: 12

Original to: blambert@lotus.com
OK. Here is a way of getting an integer root that I haven't seen yet:
 
 for (sqrtx=1, j=1, k=1; j<x; sqrtx+=1, k+=2, j+=k );
 
Try it and see. Only works for positive integers, but as there is no
multiplication or division, works reasonably fast. Especially on a 8 bit
machine.
 Not claiming it's a _better_ way... it's just a way.

--- TMail v1.19
 * Origin: Prophet BBS (8:7802/1701)


Brought to you by Super Global Mega Corp .com