Answer / glibwaresoftsolutions

Bubble sort, fast sort, balloon sort, merge sort, radix sort, and more are examples of the various kinds of sorting algorithms.
Since each algorithm was created for a certain kind of data structure where it works best, none of them can be regarded as the best or fastest.

#define f(g,h) g##h main O int i=0 int var=100 ; print f ("%d"f(var,10));} wat would be the output??

0 Answers  

---

what is dangling pointer?

1 Answers   LG Soft,

---

What is an example of structure?

0 Answers  

---

Write a C program that defines a 2-dimentional integer array called A [50][50]. Then the elements of this array should randomly be initialized either to 1 or 0. The program should then print out all the elements in the diagonal (i.e. a[0][0], a[1][1],a[2][2], a[3][3], ……..a[49][49]). Finally, print out how many zeros and ones in the diagonal.

3 Answers   Infosys,

---

Is main() function predfined or userdefined?

11 Answers  

---

what is the difference between <stdio.h> and "stdio.h"

14 Answers   Invendis, Kanbay, Mastek, MathWorks,

---

Write the control statements in C language

0 Answers   Atos Origin,

---

What is array of pointers to string?

0 Answers  

---

What is the difference between %d and %*d in C

3 Answers  

---

What is the main differences between C and Embedded C?

9 Answers  

---

What does c mean in standard form?

0 Answers  

---

what does exit() do?

3 Answers   Cadence,

---