What is head data structure??

The Gateway to Computer Science Excellence

First time here? Checkout the FAQ!

x

0 votes

**Merging k sorted lists of size n/k into one sorted list of n-elements using heap sort will take how much time ?**

My doubt

**First approach:-** here it is mentioned heap sort so, heap sort will always take nlogn.and here also we have n elements and it will take nlogn.

**But other method **is to use heap data structure of size k and merge,it will give **o(k)+(logk)*(n/k)**

I think answer should be nlogn only because the second approach is not heap sort.

Please check.

- All categories
- General Aptitude 1.6k
- Engineering Mathematics 7.3k
- Digital Logic 2.7k
- Programming & DS 4.9k
- Algorithms 4.2k
- Theory of Computation 5.4k
- Compiler Design 2.1k
- Databases 4k
- CO & Architecture 3.5k
- Computer Networks 4.2k
- Non GATE 1.4k
- Others 1.5k
- Admissions 570
- Exam Queries 566
- Tier 1 Placement Questions 23
- Job Queries 70
- Projects 18

48,756 questions

52,850 answers

183,548 comments

68,742 users