//ascending order
#include<stdlib.h>
#include<stdio.h>
#include<conio.h>
void bsrt(int*,int);
void main()
{
clrscr();
int N;
void bsrt(int*,int);
int *arr;
printf("\n how many elements to be entered:");
scanf("%d",&N);
arr=(int *)malloc((N) *sizeof(int *));
printf("\n Enter the nos one by one:");
for(int i=0;i<N;i++)
scanf("%d",&arr[i]);
bsrt(arr,N);
printf("\n Sorted array is:");
for(i=0;i<N;i++)
printf("\n %d",arr[i]);
printf("\n Minimum element is %d and Maximum element is %d",arr[0],arr[N-1]);
getch();
}
void bsrt(int* ptr,int N)
	{
	void order(int*, int*);
	int i,j;
	for(j=0;j<N-1;j++)
		for(i=j+1;i<N;i++)
		order(ptr+j,ptr+i);
	}
void order(int*n1,int*n2)
{
	if(*n1>*n2)
		{
		int temp=*n1;
		*n1=*n2;
		*n2=temp;
		}
}