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 program to find out prime number using sieve case?

0 Answers   HCL,

---

Explain what is a const pointer?

0 Answers  

---

compare array with pointer?

1 Answers  

---

matrix multiplication fails introspect the causes for its failure and write down the possible reasons for its failurein c language.

5 Answers   TCS,

---

main() { printf("hello"); fork(); }

0 Answers   Wilco,

---

I have seen function declarations that look like this

0 Answers  

---

a linearly ordered set of data elements that have the same structure and whose order is preserved in storage by using sequential allocation a) circular b) ordinary c) array d) linear list

0 Answers  

---

Hi Every one......... Please Any body give me the answer for my question. Is it possible to print the word "PRINT F", without using printf() statement in C-Language.

4 Answers  

---

suppose there are five integers write a program to find larger among them without using if- else

2 Answers  

---

How would you print out the data in a binary tree, level by level, starting at the top?

6 Answers   Amazon, Microsoft,

---

c programming of binary addition of two binary numbers

4 Answers  

---