Teaching Haryana (HPSC) Assistant Professor Mock Test 2025 Algorithms Algorithm Design Techniques Divide and Conquer
Recurrence relation for the time complexity of matrix multiplication using simple divide and conquer is:
1
\(T(n) = 8T( n/ 2 ) + Θ(n ^3 ) \)
2
\(T(n) = 8T( n/ 2 ) + Θ(n ^2 )\)
3
\(T(n) = 4T( n/ 2 ) + Θ(n ^3 )\)
4
\(T(n) = 4T( n/ 2 ) + Θ(n ^2 )\)
5
Question Not Attempted