An integer based square root algorithm (Q688630): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf01989748 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2083252370 / rank | |||
Normal rank | |||
Latest revision as of 10:03, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An integer based square root algorithm |
scientific article |
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
