Implement square root function using basic operations ?

Question

mohammadkotb · Accepted Answer

The first solution is using binary search from 0 to a that is if a > 1, and if a < 1 then search in the interval 0 to 1
and the second solution is to use Newton Raphson's Method with the iterative formula
x[n] = x[n-1] - ((x[n-1]*x[n-1]-a)/(2*x[n-1]))
and the initial guess x[0] = a/2
and it will converge faster than the binary search

Utilisateur anonyme · Answer

It is a binary search between 0 and given number. I got it that right but I messed up binary search implementation part.

Utilisateur anonyme · Answer

http://www.woolor.com/InterviewMitra/97/use-basic-operations-to-create-a-square-root-function

Meta

Question d’entretien chez Meta

Réponses aux questions d'entretien

Entreprises suivies

Recherche d’emplois