Breaking News: Grepper is joining You.com. Read the official announcement!

algorithm for square root

ali ahmed answered on May 17, 2024 Popularity 3/10 Helpfulness 1/10

answer algorithm for square root

algorithm for square root

Comment

int32_t isqrt(int32_t n) {
    assert(("sqrt input should be non-negative", n > 0));

    // X_(n+1)
    int32_t x = n;

    // c_n
    int32_t c = 0;

    // d_n which starts at the highest power of four <= n
    int32_t d = 1 << 30; // The second-to-top bit is set.
                         // Same as ((unsigned) INT32_MAX + 1) / 2.
    while (d > n) {
        d >>= 2;
    }

    // for dₙ … d₀
    while (d != 0) {
        if (x >= c + d) {      // if X_(m+1) ≥ Y_m then a_m = 2^m
            x -= c + d;        // X_m = X_(m+1) - Y_m
            c = (c >> 1) + d;  // c_(m-1) = c_m/2 + d_m (a_m is 2^m)
        }
        else {
            c >>= 1;           // c_(m-1) = c_m/2      (aₘ is 0)
        }
        d >>= 2;               // d_(m-1) = d_m/4
    }
    return c;                  // c_(-1)
}

Popularity 3/10 Helpfulness 1/10 Language cpp

Source: en.wikipedia.org

Tags: algorithm square-root whatever

Link to this answer
Share Copy Link

Contributed on May 17 2024

ali ahmed

0 Answers Avg Quality 2/10

Continue with Google

By continuing, I agree that I have read and agree to Greppers's Terms of Service and Privacy Policy.

algorithm for square root

Contents

More Related Answers

algorithm for square root

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.