Professor Arjun develops an algorithm to multiply two square matrix that is asymptotically faster than strasssen’s algorithm using divide and conquer method.
Arjun’s algorithm divide matrix into pieces of n/4 × n/4 create ‘P’ subproblems, and divide and conquer
method together will take Θ(n2) time. The recurrence for running time becomes:
Then the largest value of ‘P’ is _______.
