4. insert sort
#include<stdio.h>
#include<string.h> void insert(); main(){ char s[70]; printf("enter a string :"); gets(s); insert(strlen(s),s); printf("tre string after sorted : %s\n ",s);
}
void insert(int count,char *item){ char temp; int a,b; for (a=1;a<count;++a){ temp=item[a]; b=a-1; while(b>=0 && temp<item[b]){ item[b+1]=item[b]; b--;
}
item[b+1]=temp;
}
}

******************************************************************************

5. bubble sort
#include <stdio.h>
#include<string.h>
void bubble(); main(){ char s[70]; printf("enter a string :"); gets(s); bubble(strlen(s),s); printf("the string after sorted : %s\n",s);
}
void bubble(int num,char *str){ char temp; int a,b; for (a=1;a<num;++a) for(b=num-1;b>=a;--b){ if (str[b-1]>str[b]){ temp=str[b-1]; str[b-1]=str[b]; str[b]=temp; } } }
******************************************************************************
6. select sort
#include<stdio.h>
#include<string.h> void select(); main(){ char s[70]; printf("enter a string :"); gets(s); select(strlen(s),s); printf("tre string after sorted : %s\n ",s);
}
void select(int count,char *item){ char temp; int a,b,c; for (a=0;a<=count-1;++a){ c=a; temp=item[a]; for (b=a+1;b<count;++b){ if (item[b]<temp){ c=b; temp=item[b];
}
} item[c]=item[a]; item[a]=temp;
}
}