Question $5$

$1$ pts

Consider an algorithm that has a loop running from $1$ to $N$ and inside this loop, another loop running from $1$ to $\frac{N}{2}.$ How can the time complexity of this algorithm best be described?

$O(2^N)$

$O(NlogN)$

$O(N^2)$

$O(N)$