Register
Dark Mode

GB DSA-Test 4-Question 17
[closed]

in Programming in C closed by
602 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}})

in Programming in C closed by
by
602 views

4 Comments

Show 3 previous comments
by
D NEVER
0
0
by
how D??
0
0
by
@sandysharma

Please provide the solution which is provided in test series.....if the answer is D
0
0
← PreviousNext →
← Previous in categoryNext in category →

Related questions

Subscribe to GATE CSE 2024 Test Series

Subscribe to GO Classes for GATE CSE 2024

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

Subjects

64.3k questions

77.9k answers

244k comments

80.0k users

Developed by Chun
Link Copied!