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  

---

What is a pointer value and address in c?

0 Answers  

---

write an algorithm and c program to add two 2x2 matrics

2 Answers  

---

what does " calloc" do?

7 Answers   Cadence, Logos,

---

Write a program to print “hello world” without using semicolon?

0 Answers  

---

---

what is array?

8 Answers  

---

what is the flow of execution in cprogram? ex:printf();,scanf();

2 Answers  

---

Explain the difference between structs and unions in c?

0 Answers  

---

how does the C compiler interpret the following two statements p=p+x; q=q+y; a. p=p+x; q=q+y b. p=p+xq=q+y c. p=p+xq; q=q+y d. p=p+x/q=q+y

2 Answers   TCS, Tech Synergy,

---

What is C language ?

0 Answers   Jekson,

---

Tell me the use of bit field in c language?

0 Answers  

---

What is the memory allocated by the following definition ? int (*x)();

2 Answers   ADITI,

---