Insertion Sort Program.
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
/* The Insertion Sort. */
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;
}
}
int main(void)
{
char s[255];
printf("Enter a string:");
gets(s);
insert(s, strlen(s));
printf("The sorted string is: %s.\n", s);
return 0;
}
#include <string.h>
#include <stdlib.h>
/* The Insertion Sort. */
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;
}
}
int main(void)
{
char s[255];
printf("Enter a string:");
gets(s);
insert(s, strlen(s));
printf("The sorted string is: %s.\n", s);
return 0;
}
No comments:
Post a Comment
Vulgar language in this blog is PROHIBITED....