B CompE Bachelor of Computer Engineering Practice Test
B CompE Bachelor of Computer Engineering Algorithm Design and Analysis
What does O(n log n) time complexity indicate about an algorithm?
Select your answer
A
The algorithm runs in constant time
B
The algorithm's runtime grows linearly
C
The algorithm's runtime grows proportionally to n multiplied by the logarithm of n
D
The algorithm runs in polynomial time
Hint
