#include "stdio.h"
  #include "conio.h"
  #include "string.h"
  void main()
  {
     char str[10],temp;
     int i,j;
     clrscr();
     printf("\nEnter the string : ");
     scanf("%s",str);
     for(i=0;i<strlen(str);i++)
       for(j=0;j<strlen(str);j++)
	 if(str[i]<str[j])
	 {
	   temp = str[i];
	   str[i] = str[j];
	   str[j] = temp;
	 }
     printf("Reversed String is : %s",str);
     getch();
  }

The post Program to arrange the string in alphabetical order first appeared on Student Projects.

Logic : Here, sorting takes place by inserting a particular element at the appropriate position, that’s why the name-  insertion sorting. In the First iteration, second element A[1] is compared with the first element A[0]. In the second iteration third element is compared with first and second element. In general, in every iteration an element is compared with all the elements before it. While comparing if it is found that the element can be inserted at a suitable position, then space is created for it by shifting the other elements one position up and inserts the desired element at the suitable position. This procedure is repeated for all the elements in the list.

If we complement the if condition in this program, it will give out the sorted array in descending order. Sorting can also be done in other methods, like selection sorting and bubble sorting, which follows in the next pages.

C program for Insertion Sort:

#include
void main()
{
	int A[20], N, Temp, i, j;
	clrscr();
	printf("\n\n\t ENTER THE NUMBER OF TERMS...: ");
	scanf("%d", &N);
	printf("\n\t ENTER THE ELEMENTS OF THE ARRAY...:");
	for(i=0; i<N; i++)
	{
		scanf("\n\t\t%d", &A[i]);
	}
	for(i=1; i<N; i++)
	{
		Temp = A[i];
		j = i-1;
		while(Temp<A[j] && j>=0)
		{
			A[j+1] = A[j];
			j = j-1;
		}
		A[j+1] = Temp;
	}
	printf("\n\tTHE ASCENDING ORDER LIST IS...:\n");
	for(i=0; i<N; i++)
		printf("\n\t\t\t%d", A[i]);
	getch();
}

Download exe and source code here.

The post Insertion sort in C program first appeared on Student Projects.