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

      Question

      The time complexity of the Strassen’s algorithm for

      matrix multiplication is:
      A O(n².⁸⁰⁷) Correct Answer Incorrect Answer
      B O(n³) Correct Answer Incorrect Answer
      C O(n log n) Correct Answer Incorrect Answer
      D O(n²) Correct Answer Incorrect Answer

      Solution

      Strassen’s algorithm is an advanced matrix multiplication method that improves on the naive O(n³) approach. It achieves O(n².⁸⁰⁷) complexity using divide and conquer.

      Practice Next
      More ESIC Part B Questions

      Relevant for Exams:

      ask-question