Interested to Buy Any Domain ? << Click Here >> for more details...
#include <string.h>
#include <stdio.h>
#include <stdlib.h>
#include<conio.h>
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
- 0 Answers
- 2601 Views
- I also Faced
- E-Mail Answers
No Answer is Posted For this Question
Be the First to Post Answer
how to find no of instances of an object in .NET?
What is polymorphism what are the different types of polymorphism?
what is single inheritance?
What is the difference between procedural programming and oops?
what is different between oops and c++
why reinterpret cast is considered dangerous?
oops concept is used for?
In OverLoading concept,Why they are not consider return value and why they are consider only parameters in method? For ex: public int Add(int a,int b){...} public String Add(int a,int b){...}
Which is not an object oriented programming language?
what is new modifier in C#
What is the diamond problem in inheritance?
Why is polymorphism needed?
STL 
