printf(“Enter no.of elements you want to sort:\t”);
scanf(“%d”,&N);//Max. no. of elements
printf(“Enter %d elements you want to sort:\n”,N);
for(i=0;i<N;i++)
scanf(“%d”,(a+i));
printf(“\nBefore sorting:\t”);
display(a,N);
//Sorting Starts
bubblesort(a,N);
//Sorting Ends
printf(“\nAfter sorting:\t”);
display(a,N);
}

int * bubblesort(int *a,int N)
{
int i,j,temp;
for(i=0;i<N-1;i++)
for(j=0;j<N-i-1;j++)
if(a[j]>a[j+1])
{
temp = a[j];
a[j]=a[j+1];
a[j+1]=temp;
}
return a;

}
int display(int* a,int N)
{
int i;
for(i=0;i<N;i++)
printf(“%d\t”,*(a+i));

return 0;
}

int main()
{
int *a,n,i,j,c,temp;
printf(“Enter number of numbers you want to sort?\n”);
scanf(“%d”,&n);
a = input(a,n);
a = sort(a,n);
display(a,n);
}
int * input(int *a,int n)
{
int i;
printf(“Enter %d elements\n”,n);
a = (int *)malloc(sizeof(int)*n);
for(i=0;i<n;i++)
scanf(“%d”,&a[i]);
return a;
}
void display(int*a,int n )
{
int i;
printf(“Sorted list\n”);
for(i=0;i<n;i++)
printf(“%d\n”,a[i]);
}

int * sort(int *a,int n)
{    int i,j,temp;
if(n==0)
return a;
for(i=0;i<n-1;i++)
if(*(a+i)>*(a+i+1))
{
temp = *(a+i);
*(a+i) = *(a+i+1);
*(a+i+1) = temp;
}
sort(a,n-1);
}