Interested to Buy Any Domain ? << Click Here >> for more details...
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
- 2117 Views
- I also Faced
- E-Mail Answers
No Answer is Posted For this Question
Be the First to Post Answer
which of the function operator cannot be over loaded a) <= b)?: c)== d)*
10 Answers Cisco, CTS, Google, HCL, HP,
Can you define which header file to include at compile time?
what is the use of c program?
4 Answers Synergy, Web Synergies,
What are the parts of c program?
int i=3; this declaration tells the C compiler to a) reserve space in memory to hold the integer value b) associate the name i with this memory location c) store the value 3 at this location d) all the above
if we take a number as a char then can we manipulate(add, subtract) on this number
What is diffrance between declaration and defination of a variable or function
mplementation of stack using any programing language
How does variable declaration affect memory?
Suppose I want to write a function that takes a generic pointer as an argument and I want to simulate passing it by reference. Can I give the formal parameter type void **, and do something like this? void f(void **); double *dp; f((void **)&dp);
What are signals in C?
why return type of main is not necessary in linux
C 
