The worst case analysis for a naïve merge is given as?
(b) O( log N)
(c) O( N log N)
This interesting question is from Heap in portion Heap of Data Structures & Algorithms I
The question was posed to me during an online interview.