Really cheesy square root function

Code:

---

int sqrt(int root)
{
        int i = 0;
        bool done = false;

        while(!done)
        {
                i++;
                if ((i*i) == root)
                        done = true;
                else if (i == root)
                {
                        cout<<"No whole root";
                        done = true;
                }
        }

        return i;

}

---

This works is the square root is a whole number (25 for example), but how can I do a function that works with any number?

Also in C++:

Wynd - go here for about 8 excellent C algorithms

http://www.azillionmonkeys.com/qed/sqroot.html

The following Thread describes how to compute square root using successive approximations. It also describes how to compute other roots (cube, fourth, et cetera) and describes the Newton Raphson method for solving other types of problems.

http://www.vbforums.com/showthread.p...threadid=65366