Answer / Surajit Koley

Selection sort is a simple sorting algorithm that works by repeatedly finding the minimum element from unsorted elements and putting it at the beginning of the sorted part. The process continues until all elements are sorted.

What are the disadvantages of a shell structure?

1 Answers  

---

Hai what is the different types of versions and their differences

1 Answers  

---

a 'c' program to tell that the set of three coordinates lie on a same line

3 Answers   Persistent,

---

what is the output of the following program? main() { int c[]={2,8,3,4,4,6,7,5}; int j,*p=c,*q=c; for(j=0;j<5;j++) { printf("%d",*c); ++q; } for(j=0;j<5;j++) { printf("%d",*p); ++p; } }

4 Answers  

---

sir, i cannot find the way how to write aprogram by using array on queue

1 Answers   IISIT,

---

What is %d used for?

1 Answers  

---

what is C?

9 Answers   Syntel,

---

How to implement a packet in C

1 Answers   Aricent,

---

Write a program in c to print 1 121 12321 1234321 123454321

11 Answers   ANR, College School Exams Tests, Mu Sigma, Wipro,

---

What is an auto keyword in c?

1 Answers  

---

Is null equal to 0 in sql?

1 Answers  

---

What is meant by int fun const(int a, int b) { .... ... }

1 Answers  

---