Bresenham Circle VS others

[Mark Power]

The true beauty of Bresenham’s algorithm is that the calculations are limited to integer addition, integer subtraction and integer x4 which can be implemented as shift left by 2 bits. All of which means the algorithm can be implemented in assembly language/machine code for stunning speed on the most basic of processors.

If you want to see an HP48 implementation in assembly language have a look at glib.