So summarizing, overall, the number of primitive operations required to multiply to n digit numbers using this procedure grows quadratically with the length N. So, for example, if you double the length of two numbers, you expect to do roughly four times as many primitive operations if you use this iterative algorithm for multiplying two numbers. 