Question
Download Solution PDFConsider the recurrence relation :
\(T(n) = 8T \left(\frac{n}{2}\right)+Cn, if \;n > 1\)
= b, if n = 1
Where b and c are constants.
The order of the algorithm corresponding to above recurrence relation is :
Answer (Detailed Solution Below)
Detailed Solution
Download Solution PDFThe correct answer is option 4.
Master's theorem:
\(T(n) = aT \left(\frac{n}{b}\right)+f(n)\) where a > = 1 and b > 1
Case: 1. If f(n) = Θ(nc) where c < Logba then T(n) = Θ(nlogba)
EXPLANTION
\(T(n) = 8T \left(\frac{n}{2}\right)+Cn, if \;n > 1\)
= b, if n = 1
Where b and c are constants.
The above recurrence is in the form of the
Here, c = Log28 = 3
f(n) = Θ(n3)
Hence the correct answer is n3.
Last updated on Jun 11, 2025
-> The UGC NET Exam Schedule 2025 for June has been released on its official website.
-> Check UPSC Prelims Result 2025, UPSC IFS Result 2025, UPSC Prelims Cutoff 2025, UPSC Prelims Result 2025 Name Wise & Rollno. Wise
-> The UGC NET Application Correction Window 2025 is available from 14th May to 15th May 2025.
-> The UGC NET 2025 online application form submission closed on 12th May 2025.
-> The June 2025 Exam will be conducted from 21st June to 30th June 2025
-> The UGC-NET exam takes place for 85 subjects, to determine the eligibility for 'Junior Research Fellowship’ and ‘Assistant Professor’ posts, as well as for PhD. admissions.
-> The exam is conducted bi-annually - in June and December cycles.
-> The exam comprises two papers - Paper I and Paper II. Paper I consists of 50 questions and Paper II consists of 100 questions.
-> The candidates who are preparing for the exam can check the UGC NET Previous Year Papers and UGC NET Test Series to boost their preparations.