What’s the Big-Oh runtime of this C++ code?

Give a tight bound of the nearest runtime complexity class for the following code fragments in Big-Oh notation, in terms of the variable N. In other words, write the code’s growth rate as N grows. Write a simple expression that gives only a power of N, such as O(N2) or O(log N), not an exact calculation like O(2N^3+ 4N + 14). int sum = 0;for (int i = 1; i <= N + 2; i++) { sum++;}for (int j = 1; j <= N * 2; j++) { sum += 5;} cout << sum << endl;

Looking for this or a Similar Assignment? Click below to Place your Order

Open chat