PEC EPE Computer & Allied
PEC EPE — Computer and Allied Engineering (Computer/Computer Systems/Software, Pakistan Engineering Council)
Full question bankEnglish
Exam overviewPractice session
A divide-and-conquer algorithm solves a problem of size n by recursively solving 4 subproblems of size n/2, with the partitioning and combination step taking cn^2 time (for some constant c > 0). According to the Master Theorem, what is the asymptotic runtime complexity T(n)?
Loading your practice session…