closed by
607 views
0 votes
0 votes
closed

The number of elements that can be sorted in Θ(2^{n}) time using merge sort is, where n is the size of input which can be represented as some k^{th} power of 2 for some positive integer k:

(A) \theta(\frac{2^n}{logn})

(B) \theta(\frac{2^{n-k}}{logn})

(C) \theta(\frac{n2^{n}}{k})

(D) \theta({2^{n-k}})

closed by

Related questions

0 votes
0 votes
0 answers
1
Sandy Sharma asked Sep 21, 2018
349 views
Consider the graph shown below:Cardinality of the largest maximum independent set of the above graph is: ——?
1 votes
1 votes
0 answers
3
Sandy Sharma asked Nov 19, 2018
591 views
The gray code for a decimal number N is . This number N is converted into P which belongs to 84 − 2 − 1 code system. What is the Hexadecimal representation for P?(A) ...
3 votes
3 votes
1 answer
4
Sandy Sharma asked Nov 19, 2018
330 views
If decimal value of is less than that of then possible values of x and y in octal number system respectively are:(A) 11, 16(B) 15, 9(C) 9, 12(D) 17, 11