Which of the following describes an algorithm with O(n²) time complexity?
-
A
Execution time doubles when input size doubles
-
B
Execution time increases proportionally to the square of the input size
-
C
Execution time is constant regardless of input
-
D
Execution time grows logarithmically with input size