Estimate the number of bit operations needed to find 1 + 2 + ⋯ + n,
a) by performing all the additions;
b) by using the identity 1 + 2 + ⋯ + n = n(n + 1)/2, and multiplying and shifting.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.