/* Include required header files */

#include<iostream.h>
#include<stdio.h>
#include<string.h>
#include<conio.h>

Selection sort method. This method accepts pointer to the character array which contain the characters to be sorted
and the length of the array.

void selsort(char *items,int count){

// Local variable declaration
int a,b,c;
int exchange;
char t;

// Loop over the array of characters
for(a
=0;a<count-1;++a){

exchange=0;
c=a;
t=items[a];


Test and swap the current character with the next position till the next character is less than the current one. In a way to say move the character to its position in the present iteration of sorting. The continue with the next character and so on... For example, consider the word "sortme" In the first iteration the character 's' will be moved to the third position by comparing with each character until the character 't' founds, which is greater than 's'.

for(b=a+1;b<count;++b){
if(items[b]<t){
c=b;
t=items[b];
exchange=1;
}
}
if(exchange){
items[c]=items[a];
items[a]=t;
}
}
}

Now use the above methods to sort the characters of a string.

void main(){
clrscr();
char s[30];
cout<<"Enter A String:";
gets(s);
selsort(s,strlen(s));
cout<<"The String After Selection Sort:"<<s;
getch();
}

Like it on Facebook, +1 on Google, Tweet it or share this article on other bookmarking websites.


Written by
Maverick
A computer geek, who always love coding, now fell in love with beautiful Bootstrap framework :)
  • No comments found