| ??? 01/09/08 11:41 Read: times |
#149170 - How many cycles per iteration ? Responding to: ???'s previous message |
The iterative approximation still contains one long-by-long division per iteration, which most likely uses up a significant number of CPU cycles (especially on a '51, where the library function will have to do this division "by hand" with conditional subtraction).
It'd be interesting to see how the approximation fares against an "exact" integer square root algorithm (which uses bit-shifts and additions/subtractions only, not multiplication or division). |
| Topic | Author | Date |
| Integer square root algorithm performance | 01/01/70 00:00 | |
| How many cycles per iteration ? | 01/01/70 00:00 | |
| The edge of chaos | 01/01/70 00:00 | |
| Yes, but he can simulate the performance... | 01/01/70 00:00 | |
| Convergence | 01/01/70 00:00 | |
| Why not ? | 01/01/70 00:00 | |
Sample testing | 01/01/70 00:00 | |
| some links | 01/01/70 00:00 |