Given an array A[n+m] of n+m numbers, where A[1] ... A[n] is
sorted and A[n+1] ... A[n+m] is
sorted. Design a linear time algorithm to obtain A[1...n+m]
sorted using only O(1) extra space.
Time Complexity of your algorithm should be O(n) and Space
Complexity O(1).


No Answer is Posted For this Question
Be the First to Post Answer

Post New Answer

More C Interview Questions

cavium networks written test pattern ..

0 Answers   Cavium Networks,


for(;;) printf("C language") What is out put of above??

2 Answers   Practical Viva Questions,


What is a spanning Tree?

1 Answers   TCS,


main() { int a = 65; printf(“%d %o %x”,a,a,a); } Output 65 101 41 Please explain me.How it is coming like that?

3 Answers   Excel,


What are the 5 types of organizational structures?

0 Answers  


How can I read a binary data file properly?

0 Answers  


Why double pointer is used in c?

0 Answers  


what does static variable mean?

0 Answers   TCS,


What is ## preprocessor operator in c?

0 Answers  


What is the proper way of these job Tell me about there full work

0 Answers   EDS,


what is c

1 Answers  


how to find string length wihtout using c function?

6 Answers  


Categories