Data Structures Selection Sort C Program

Data Structures Lab Manual / Data Structures Selection Sort C Program

Program Name: Write a C Program for Selection Sort in Data Structures

Theory

In selection sort the first smallest element is placed at the first position 
and then second smallest element is selected and placed in the second position
of the array like this the process continues till all entire array got sorted.

Program Code

#include<stdio.h> 
#include<conio.h> 
void select(int [],int); 
void bubble(int [],int); 
int min(int [],int,int);

void main()
{
int a[20],i,n; 
printf("Enter Number of Elements: "); 
scanf("%d",&n);

printf("Enter Array Elements: ");  
for(i=0;i<n;i++)
scanf("%d",&a[i]);

bubble(a,n);
select(a,n);
getch();
}
void bubble(int a[],int n)
{
int i,temp,p; for(i=1;i<n;i++)
{
for(p=0;p<n-i;p++)
{
if(a[p]>a[p+1])
{
temp=a[p]; a[p]=a[p+1]; a[p+1]=temp;
}
}
}
printf("Data After Bubble Sort: "); 
for(i=0;i<n;i++) 
printf("\t%d",a[i]);
printf("\n");
}


void select(int a[],int n)
{
int i, j, small;  
      
for (i = 0; i < n-1; i++)    
{  
small = i; 
          
for (j = i+1; j < n; j++)  
if (a[j] < a[small])  
small = j;  
// Swapping  
int temp = a[small];  
a[small] = a[i];  
a[i] = temp;  
}  
    
printf("Data After Selection Sort: ");
for(i=0;i<n;i++)
printf("\t%d",a[i]);
}

Input:
Enter Number of Elements: 5
Enter Array Elements: 5 7 9 2 1

Output:
Data After Bubble Sort: 	1	2	5	7	9
Data After Selection Sort: 	1	2	5	7	9

Home Back