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  

---

hi to every one .. how to view table pool after creating the pooled table? plz help me.. if any knows abt this ..

0 Answers  

---

Draw a flowchart to produce a printed list of all the students over the age of 20 in a class .The input records contains the name and age of students. Assume a sentinel value of 99 for the age field of the trailer record

0 Answers   Wipro,

---

How many parameters should a function have?

0 Answers  

---

what will be the output of" printf("%d%d",scanf("%d% d",&a&b));"

4 Answers  

---

7. Identify the correct argument for the function call fflush() in ANSI C: A)stdout B)stdin C)stderr D)All the above

10 Answers   Accenture,

---

How can you tell whether a program was compiled using c versus c++?

0 Answers  

---

Where are the auto variables stored?

0 Answers   TISL,

---

What is sizeof c?

0 Answers  

---

main() { unsigned int k = 987 , i = 0; char trans[10]; do { trans[i++] =(char) (k%16 > 9 ? k%16 - 10 + 'a' : '\0' ); } while(k /= 16); printf("%s\n", trans); }

4 Answers   Vector,

---

20. main() { int i=5; printf("%d%d%d%d%d%d",i++,i--,++i,--i,i); } Answer:??????

2 Answers  

---

Can stdout be forced to print somewhere other than the screen?

0 Answers  

---