C program to implement bubble sort using function and pointers

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

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

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