Vidyalelo
Data Structure · Q163

Heaps

Programming · Data Structure · question 163

Q163

The worst case analysis for a naive merge is given as?

A.
O(N)
Answer
B.
O( log N)
C.
O( N log N)
D.
O(N2)

Answer: Option A

Solution

Answer: Option A
No explanation is given for this question Let's Discuss on Board