DEPARTMENT OF CSE

Name of the
A.GEETIKA SUMA
Student
Roll Number 18R21A05C5
Name of the Lab DATA STRUCTURE
Week No WEEK - 11

1.Write a C Program to sort given integer values using Selection Sort.

#include<stdio.h>
int a[20],i,j,min,temp,n;
void ssort(int a[],int n)
{
for(i=0;i<n-1;i++)
min=i;
for(j=i+1;j<n;j++)
{
if(a[min]>a[j])
{
min=j;
}
}
temp=a[min];
a[min]=a[i];
a[i]=temp;
}
int main()
{
printf("enter no.of elements\n");
scanf("%d",&n);
printf("enter elements\n");
for(i=0;i<n;i++)
scanf("%d",&a[i]);
printf("elements before sorting\n");
for(i=0;i<n;i++)
printf("%3d ",a[i]);
printf("\n");
ssort(a,n);
printf("after sorting\n");
for(i=0;i<n;i++)
printf("%3d",a[i]);
}
Test case:1
 DEPARTMENT OF CSE

Test case:2

Test case :3

2. Write a C Program to sort given integer values using Quick Sort.

#include<stdio.h>
int i,j,t,pivot;
void qsort(int a[10],int first,int last)
{
if(first<last)
{
i=first;
j=last;
pivot=first;
while(i<j)
{
while(a[i]<=a[pivot]&&i<last)
i++;
 DEPARTMENT OF CSE
while(a[j]>a[pivot])
j--;
if(i<j)
{
t=a[i];
a[i]=a[j];
a[j]=t;
}
}
t=a[pivot];
a[pivot]=a[j];
a[j]=t;
qsort(a,first,j-1);
qsort(a,j+1,last);
}
}
int main()
{
int i,a[30],n;
printf("Enter no. of elements\n");
scanf("%d",&n);
printf("Enter elements\n");
for(i=0;i<n;i++)
scanf("%d",&a[i]);
qsort(a,0,n-1);
printf("Elements in sorted order\n");
for(i=0;i<n;i++)
printf("%d ",a[i]);
}
Test case:1

Test case 2:
 DEPARTMENT OF CSE

Test case 3:

3. Write a C Program to sort given characters using Insertion Sort.

#include<stdio.h>
void isort(char a[10],int n)
{
int i,j,temp;
for(i=1;i<n;i++)
{
temp=a[i];
j=i-1;
while(temp<a[j]&&j>=0)
{
a[j+1]=a[j];
j--;
}
a[j+1]=temp;
}
}
int main()
{
int n,i,j;
char a[10];
printf("enter no.of elements\n");
scanf("%d",&n);
printf("enter elements\n");
for(i=0;i<n;i++)
scanf("%c",&a[i]);
printf("elements before sorting\n");
for(i=0;i<n;i++)
printf("%3c ",a[i]);
printf("\n");
 DEPARTMENT OF CSE
isort(a,n);
printf("after sorting\n");
for(i=0;i<n;i++)
printf("%3c",a[i]);
}
Test case1:

Test case 2:

Test case 3: