By Topic

Three early algorithms

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)

Three well-known algorithms, implemented separately within a span of 20 years, demonstrate the use of mathematics developed hundreds of years ago. The algorithms don't have much in common except for two things: they were implemented between 1949 and 1965 during the so-called first generation of computing hardware-and they are good examples of rigorous thinking. First, I explain Bresenham's algorithm and apply it to a fundamental process of computer graphics-drawing a line on a raster screen. Second, although there are several ways to calculate a square root, the square root algorithm is interesting because it takes advantage of hardware design. And, finally, while the calculation of n goes back more than 2,200 years, Machin's algorithm from 1706 is of importance to the history of computing.

Published in:

Annals of the History of Computing, IEEE  (Volume:24 ,  Issue: 4 )