if you call the Heapify then for n element then it will take = O(n log n) time.

The Solution of this problem is

Take All the 2*n element and call the Build Heap().

So, It will take O(2n) = O(n) time.

The Gateway to Computer Science Excellence

First time here? Checkout the FAQ!

x

0 votes

https://gateoverflow.in/459/gate2008-47

here if we insert all elements together and then call heapify function then it’ll take O(logn) time. why answer is O(n)?

- 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,744 users