Login / Signup

Question

What is the recurrence relation for Merge Sort?

A T(n) = T(n-1) + O(1)

B T(n) = 2T(n/2) + O(n)

C T(n) = T(n/2) + O(n)

D T(n) = 2T(n-1) + O(1)

E T(n) = 2T(n) + O(n)

Practice Next

More IT Operating System Questions

Which functional dependency holds in given relation R (A, B, C) and why?
Consider the following Python code for calculating Fibonacci numbers using memoization: memo = {} def fib_memo(n): if n ret...
Which traversal method for a binary tree processes the root node *after* visiting both its left and right subtrees?
When implementing Huffman Coding, a common issue arises if the generated codes are not unique prefixes (i.e., one code is a prefix of another, leading to a...
In which of the following scenarios would the Floyd-Warshall algorithm be most suitable?
Which access specifier makes members accessible only within the class itself?
Inheritance is an OOP principle that establishes an "is-a" relationship between classes. What does this relationship primarily allow?
Which algorithm is used for constraint satisfaction problems?
Which of these models is best suited for language translation?
int i=10; float f=i; What kind of typecasting is happening in the above scenario?

Hey! Ask a query

ask-question