Sail E0 Webinar
Question
If for an algorithm time complexity is given by O(n) then complexityof it is:
Options:
A .  A. constant
B .  B. linear
C .  C. exponential
D .  D. none of the mentioned
Answer: Option B

Submit Your Solution Below and Earn Points !
Next Question

Submit Solution

Your email address will not be published. Required fields are marked *

Latest Videos

Latest Test Papers