The thesis covers the various division algorithms which are found in high-speed (parallel) binary computers. Restoring, non-restoring, and S-R-T division are discussed. Particular emphasis is placed on the quadratic convergence algorithm, where the basic mathematical operator is multiplication, rather than subtraction, and where each iteration of the algorithm results in a doubling of the number of quotient bits which are formed.