PA of Algorithms Q61
- Option : A
- Explanation : Applying Master’s Theorem cn > nln3 1 cn > n0 Now checking af(n/b) ≤ kf(n) for some k < 1 1*cm/3 ≤ kcn This is true for k > 1/3 Hence solution is Θ(n).
You must be logged in to post a comment.
You must be logged in to post a comment.
You must be logged in to post a comment.