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  

---

write a c program in such a way that if we enter the today date the output should be next day's date.

0 Answers  

---

How do we open a binary file in Read/Write mode in C?

0 Answers   Alter,

---

what is the difference between exit() and _exit() functions?

2 Answers  

---

write a program to find out prime number using sieve case?

0 Answers   HCL,

---

Can you please explain the difference between strcpy() and memcpy() function?

0 Answers  

---

i want explaination about the program and its stack reprasetaion fibbo(int n) { if(n==1 or n==0) return n; else return fibbo(n-1)+fibbo(n-2); } main() { fibbo(6); }

2 Answers  

---

What is the output from this program? #include <stdio.h> void do_something(int *thisp, int that) { int the_other; the_other = 5; that = 2 + the_other; *thisp = the_other * that; } int main(void) { int first, second; first = 1; second = 2; do_something(&second, first); printf("%4d%4d\n", first, second); return 0; }

3 Answers  

---

Which sorting algorithm is the best?

1 Answers  

---

multiple of 9 without useing +,* oprator

3 Answers  

---

pick out the odd one out of the following a.malloc() b.calloc() c.free() d.realloc()

2 Answers   TCS, ZenQ,

---

hw can we delete an internal node of binary search tree the internal node has child node..plz write progarm

0 Answers   TCS,

---