An integer based square root algorithm (Q688630)

From MaRDI portal
Revision as of 10:03, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    0 references
    0 references
    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
    0 references
    square root algorithm
    0 references
    bisection method
    0 references
    Newton's method
    0 references
    0 references