Answer Posted / binay pandit

The answer given by the gurunath is perfectly correct. i
mean excellent.

#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

2577

---

What is polymorphism oop?

1013

---

What do you mean by Encapsulation?

1041

---

Can we create object of abstract class?

1039

---

Which is better struts or spring?

1002

---

Why multiple inheritance is not allowed?

1096

---

What is the importance of oop?

1046

---

What are the 3 pillars of oop?

1118

---

What is destructor give example?

1019

---

What is encapsulation in oop?

996

---

What are the benefits of oop?

1180

---

What is the real life example of polymorphism?

1120

---

Are polymorphisms mutations?

1112

---

What is encapsulation with example?

1036

---

What is constructor overloading in oop?

1088

---