[solved] – Question 99244

Squaring a binary number requires a number of
additions (of binary digits) – as well as other manipulations such as
copying strings of bits and layout. Assuming an addition counts as
one operation and other manipulations don’t count as operations
then calculate a worst case scenario value for the Big-O of the
squaring function assuming the values being squared have N binary
digits – i.e. Squaring = O(f(N)). Approximate f(N).

Expert Answer

---