📢 Too many exams? Don’t know which one suits you best? Book Your Free Expert 👉 call Now!
  • google app store apple app store
    • ✖

      Question

      An algorithm with a time complexity of O(log n) means

      that its execution time:
      A Grows linearly with the input size. Correct Answer Incorrect Answer
      B Grows quadratically with the input size. Correct Answer Incorrect Answer
      C Grows logarithmically with the input size, becoming very efficient for large inputs. Correct Answer Incorrect Answer
      D Is constant, regardless of the input size. Correct Answer Incorrect Answer
      E Is dependent on the square of the input size. Correct Answer Incorrect Answer

      Solution

      Grows logarithmically with the input size, becoming very efficient for large inputs.

      Practice Next
      More Data Structure Questions
      ask-question