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
- 1610 Views
- I also Faced
- E-Mail Answers
No Answer is Posted For this Question
Be the First to Post Answer
simple program for virtual function?
What is the process of writing the null pointer?
What does a derived class inherit from a base class a) Only the Public members of the base class b) Only the Protected members of the base class c) Both the Public and the Protected members of the base class d) .c file
Explain void pointer?
Write a C/C++ program to add a user to MySQL. The user should be permitted to only "INSERT" into the given database
2 Answers TCS, Unisys, Webyog,
What is far pointer in c?
What are runtime error?
Explain how do you print an address?
Concat two string with most overlapped substring has to remove "abcd"+ "cdef" = "abcdef
Do pointers need to be initialized?
What is a void pointer in c?
what is compiler
C 
