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
- 2106 Views
- I also Faced
- E-Mail Answers
No Answer is Posted For this Question
Be the First to Post Answer
related proverb of "dont count your chicken before it hatches"
what is the difference between NULL('\0') and 0?
What is a char c?
I came across some code that puts a (void) cast before each call to printf. Why?
Explain what is a 'null pointer assignment' error? Explain what are bus errors, memory faults, and core dumps?
How can variables be characterized?
biggest of two no's with out using if condition statement
What is a static variable in c?
What is the purpose of #pragma directives in C?
main() { struct s1 { char *str; struct s1 *ptr; }; static struct s1 arr[] = { {"Hyderabad",arr+1}, {"Bangalore",arr+2}, {"Delhi",arr} }; struct s1 *p[3]; int i; < BR> for(i=0;i<=2;i++) p[i] = arr[i].ptr; printf("%s ",(*p)->str); printf("%s ",(++*p)->str); printf("%s ",((*p)++)->str); }
main() { int i; printf("%d", &i)+1; scanf("%d", i)-1; }
What is true about the following C Functions (a) Need not return any value (b) Should always return an integer (c) Should always return a float (d) Should always return more than one value
C 
