If an algorithm with an input size of n has a nested loop,and both loops make a complete pass over the input,then the performance of the algorithm will be
A) constant time
B) linear time
C) logarithmic time
D) quadratic time

Question

Quizplus · Accepted Answer

If both loops run a complete pass over the input, the time complexity will be O(n^2), also known as quadratic time. This is because the outer loop will run n times, and the inner loop will run n times for each iteration of the outer loop, resulting in n*n = n^2 iterations. Therefore, the algorithm has a quadratic time complexity.

If an Algorithm with an Input Size of N Has