Comment Comment by polyphonicist From the article:> We will be dealing with arbitrary precision integers (bignums) in the problem, so let us also make a few assumptions:> Addition or subtraction of an m-bit integer and an n-bit integer (m <= n) takes O(n) time.> Counting the number of 1-bits in an n-bit integer takes O(n) time. parent polyphonicist 6 years ago
> We will be dealing with arbitrary precision integers (bignums) in the problem, so let us also make a few assumptions:
> Addition or subtraction of an m-bit integer and an n-bit integer (m <= n) takes O(n) time.
> Counting the number of 1-bits in an n-bit integer takes O(n) time.