The paper reviews the algorithms for the computation of square roots for binary machines. After an initial classification, the algorithms are analysed in detail by considering their specific peculiarities and properties. Finally, some comments are made regarding their ideal and effective implementation in hardware, software or microcode