📢 Too many exams? Don’t know which one suits you best? Book Your Free Expert 👉 call Now!

  • google app store apple app store
  • ✖

      Question

      If an algorithm takes $5n²  + 3n + 10$ steps for an

      input of size n, its Big O notation would be:
      A O(n) Correct Answer Incorrect Answer
      B O(n log n) Correct Answer Incorrect Answer
      C O(n²) Correct Answer Incorrect Answer
      D O(n³) Correct Answer Incorrect Answer
      E O(1) Correct Answer Incorrect Answer

      Solution

      O(n²)

      Practice Next
      ask-question