An integer based square root algorithm (Q688630)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An integer based square root algorithm |
scientific article; zbMATH DE number 437721
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An integer based square root algorithm |
scientific article; zbMATH DE number 437721 |
Statements
An integer based square root algorithm (English)
0 references
28 November 1993
0 references
The square root for integer numbers is computed bit after bit, i.e. the bisection method is used. Here only additions and shifts are required. The reviewer is surprised that this method is faster than Newton's method for 48-bit numbers and a 32-bit Motorola 68000 micro processor.
0 references
square root algorithm
0 references
bisection method
0 references
Newton's method
0 references
