write a C and C++ programme to implement the A,bubble sort B,quick sort C,insertion sort D,sequential search E,binary search

1 Answers   ADP, TCS,

---

How do we select the big element or any other operation from array which is read dynamically. user need to give the elements only no need to mention the size.

0 Answers  

---

the operator for exponencation is a.** b.^ c.% d.not available

5 Answers   TCS,

---

n=7623 { temp=n/10; result=temp*10+ result; n=n/10 }

7 Answers   Wipro,

---

what is use of loop?

10 Answers   Infosys,

---

---

Which of these statements are false w.r.t File Functions? i)fputs() ii)fdopen() iii)fgetpos() iv)ferror() A)ii B)i,ii C)iii D)iv

6 Answers   Accenture,

---

main() { int i = 10; printf(" %d %d %d \n", ++i, i++, ++i); }

10 Answers   TCS, Vector,

---

What is hungarian notation? Is it worthwhile?

0 Answers  

---

why do we use # in c-language?

1 Answers  

---

what is pointer

1 Answers   TCS,

---

pgm to reverse string using arrays i.e god is love becomes love is god) (assumption:only space is used for seperation of words) no addtional memory used.i.e no temporary arrays can used.

4 Answers   Persistent, Valyoo,

---

What is the time and space complexities of merge sort and when is it preferred over quick sort?

0 Answers   Amazon,

---