Skip to content
College Subject Practice · College Year 1

Divide and Conquer practice questions — College Subject Practice · College Year 1 Algorithms

Practise divide and conquer with topic-based questions. Preview a sample, then start a short session.

See the question style before signup · Get instant feedback · Continue with focused practice

Try a sample question

Check your answer to see the explanation where one has been published.

Try this question
For T(n)=T(n/2)+O(1)T(n)=T(n/2)+O(1), the Master Theorem gives:

1 sample question · No signup needed

Something unclear? Report this question.

2
For the recurrence T(n)=2T(n/2)+O(n)T(n)=2T(n/2)+O(n), what is the solution by the Master Theorem?
3
What is the asymptotic running time of Karatsuba's integer multiplication?
Start a sample session

50 published questions available for this topic.