C program to implement selection sort using function and pointer

Posted: January 28, 2012 in Lab 4
#include<stdio.h>
#include<stdlib.h>
int selectionsort(int *,int);
int selectionsort(int *arr,int n)
{
	int i,j,temp;
for(i=0;i<n;i++)
		for(j=i+1;j<n;j++)
		{
			if(*(arr+i)>*(arr+j))
			{
				temp=*(arr+j);
				*(arr+j)=*(arr+i);
				*(arr+i)=temp;
			}
		}
	return 0;
}

int main()
{
	int *arr,n,i;
	printf("Enter no. of elements\n");
	scanf("%d",&n);
	arr=(int *)malloc(n*sizeof(int));
	printf("Enter elements\n");
	for(i=0;i<n;i++)
		scanf("%d",(arr+i));
	selectionsort(arr,n);
	printf("Sorted elements are\n");
	for(i=0;i<n;i++)
		printf("%d\n",*(arr+i));
return 0;
}
Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s