Answer / guest

1,2,3

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 the diff between the printf and sprintf functions?? and what is the syntax for this two functions ??

5 Answers  

---

which header file contains main() function in c?

17 Answers   Google, HCL, TCS,

---

What is define c?

0 Answers  

---

What is the explanation for cyclic nature of data types in c?

0 Answers  

---

---

can u suggest me am in a confusion to choose whether to go to c programming or a software testing . am a graduate in B.sc(electronics).

1 Answers  

---

What is c language & why it is used?

0 Answers  

---

what is the advantage of using SEMAPHORES to ORDINARY VARIABLES???

2 Answers   NSN,

---

write a addition of two no. program with out using printf,scanf,puts .

4 Answers  

---

Where local variables are stored in c?

0 Answers  

---

Describe the complexity of Binary search, Quicksort and various other sorting and searching techniques..

0 Answers   Huawei,

---

if a five digit number is input through the keyboard, write a program to calculate the sum of its digits. (hint:-use the modulus operator.'%')

23 Answers  

---