I am trying to understand the divide and conquer 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.
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?