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
- 2107 Views
- I also Faced
- E-Mail Answers
No Answer is Posted For this Question
Be the First to Post Answer
What is static memory allocation? Explain
What is your favorite subject?
1 Answers Ericsson, Invendis, Tech Mahindra,
how c source file in converted to exe file
Difference between data structure and data base.
7 Answers CTS, Value Labs, Zoho,
if a five digit number is input through the keyboard, write a program to calculate the sum of its digits. (hint:-use the modulus operator.'%')
an expression contains relational operators, assignment operators, and arithmatic operstors. In the absence of parentheses, they will be evaluated in which of the following order a) assignment, relational, arithematic b) arithematic, relational, assignment c) relational, arithematic, assignment d) assignment, arithematic, relational
What are nested functions in c?
Why is event driven programming or procedural programming, better within specific scenario?
Why we use break in c?
Explain how do you override a defined macro?
What will be the output of following program #include main() { int x,y = 10; x = y * NULL; printf("%d",x); }
can we execute the program with the object file
C 
