What is the Big Oh of the following computation?
int sum = 0;for (int counter = n; counter > 0; counter = counter - 2)sum = sum + counter;
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.