I am trying to understand the divide and conquer division algorithm that is used in the GMP bignum arithmetic library.The code is very optimised and that makes it somewhat hard to understand. the doc does not really offer an explanation of how it is done, (and the references do not point to an actual algorithm, not one that I could see anyway).I understand the concept of divide and conquer for sorting, but I am not sure I understand how it can be used in a division.How can $x \over y$ be calculated using divide and conquer?Can someone give a small example of how it is done?
Divide and Conquer division algorithm explained (as used in GMP bignum)
optimization;algorithms;computer arithmetic