   sqrt problem
  Given a perfect square number, is it possible to find the square root of thatnumber without the sqrt function ? Maybe using bit operations?   
  Integers or floats?You can find quite a few fast integer sqrt implementations in C/C++/asm flavors (assuming that speed is implied in your question).  Other than that, the infamous fast inverse square root algorithm comes to mind...  Is there a reason why you need to avoid using sqrt?   ;  Sometimes you do not need the sqrt..try solving the problem with the squared value directly.   ;  One simple method is Newton's method. You start with an estimate, then repeat the following until the result stops changing:new_estimate = (the_perfect_square / old_estimate + old_estimate) / 2;There are several other methods as well, such as the bitwise method which you'll find in the last link below:http://en.wikipedia.org/wiki/Methods_of_computing_square_rootshttp://en.wikipedia.org/wiki/Integer_square_roothttp://www.embedded.com/98/9802fe2.htm