Question:
Apply the master theorem on \(T(n) = 8T.(\frac{n}{2})+n^3\)
Apply the master theorem on \(T(n) = 8T.(\frac{n}{2})+n^3\)
Updated On: Mar 16, 2024
- O(n2)
- O(n3)
- \(O(n^3\,\,log_2n),\)
- \(O(n\,\,\,log_2n),\)
Hide Solution
Verified By Collegedunia
The Correct Option is B
Solution and Explanation
The correct option is(B): O(n3)
Was this answer helpful?
0
0
Top Questions on Data Structures
- Which data structure follows the Last-In-First-Out (LIFO) principle?
- CUET (UG) - 2025
- Computer Science
- Data Structures
- What is the time complexity of a binary search algorithm on a sorted array?
- CUET (UG) - 2025
- Computer Science
- Data Structures
- In the context of graph algorithms, what is the significance of Dijkstra’s algorithm?
- CUET (UG) - 2025
- Computer Science
- Data Structures
- In a binary tree, what is the maximum number of nodes at level k?
- CUET (UG) - 2025
- Computer Science
- Data Structures
- Which sorting algorithm has the best average-case time complexity?
- CUET (UG) - 2025
- Computer Science
- Data Structures
View More Questions
Questions Asked in CUET PG exam
- What is the antonym of eradicate?
- CUET (PG) - 2025
- Antonyms
- What is the correct verb form: He, as well as his friends, ?
- Identify the possessive noun: My office car is parked elsewhere.
- When did the Dutch set up their factory at Nizampatnam?
- CUET (PG) - 2025
- Medieval Indian History
- What is the one-word synonym for connotation?
- CUET (PG) - 2025
- Synonyms
View More Questions