Answer Posted / venkatreddy

Kalyan IT is the best .

#include #include #include #include void insert(char *items, int count); int main(void) { char s[255]; printf("Enter a string:"); gets(s); insert(s, strlen(s)); printf("The sorted string is: %s.\n", s); getch(); return 0; } void insert(char *items, int count) { register int a, b; char t; for(a=1; a < count; ++a) { t = items[a]; for(b=a-1; (b >= 0) && (t < items[b]); b--) items[b+1] = items[b]; items[b+1] = t; } } design an algorithm for Insertion Sort

2168

---

What is difference between polymorphism and inheritance?

617

---

How to use CMutex, CSemaphore in VC++ MFC

4333

---

what is difference between class template and template class?

2159

---

What is an advantage of polymorphism?

597

---

---

Why do we use polymorphism in oops?

581

---

What do you mean by Encapsulation?

642

---

Why is destructor used?

585

---

What are the data types in oop?

608

---

What is object in oop?

679

---

what is different between oops and c++

2001

---

Why oops is important?

614

---

Why do we use polymorphism?

579

---

What is polymorphism explain its types?

684

---

Why do we use class in oops?

555

---