bigoh$9$

Language$/$Type:

C$++$ algorithm analysis big$-$oh

Related Links:

Wikipedia: Big$-$Oh

Give a tight bound of the nearest runtime complexity class for each of 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$ using a caret $^$ character for exponentiation, such as $0(N^2)$ to represent $O(N^2)$ or $0(logN)$ to represent

N$).$ Do not write an exact calculation of the runtime such as $O(2N^3+4N+14).$

The answer isn't O$($n$^2)$ or O$($N$).$ I've also tried O$($n log n$),$ O$($log n$),$ etc. I hope to have some form of revelation towards how to solve this on Code Step by Step