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).
- 0 Answers
- 1867 Views
- I also Faced
- E-Mail Answers
cavium networks written test pattern ..
for(;;) printf("C language") What is out put of above??
2 Answers Practical Viva Questions,
What is a spanning Tree?
main() { int a = 65; printf(“%d %o %x”,a,a,a); } Output 65 101 41 Please explain me.How it is coming like that?
What are the 5 types of organizational structures?
How can I read a binary data file properly?
Why double pointer is used in c?
what does static variable mean?
What is ## preprocessor operator in c?
What is the proper way of these job Tell me about there full work
what is c
how to find string length wihtout using c function?
C 
