Question

The time complexity of the Strassen’s algorithm for matrix multiplication is:

A O(n².⁸⁰⁷)
B O(n³)
C O(n log n)
D O(n²)
Practice Next

Relevant for Exams:

Hey! Ask a query

🎓
Think You're Ready for RBI Grade B?
RBI Grade B 2026 Phase 1 Memory Based Paper
  • 200 Questions with Detailed Solutions
  • Section-wise Coverage (GA, English, Quant & Reasoning)