#include <stdio.h>
#include <stdlib.h>
void swap(int *a , int *b);
void max(int*, int N, int p[]);
void min(int*, int N, int p[]);

int main()
{
    int i,j,N;
    int *array;
    printf("Give size of array: ");
    scanf("%d", &N);
    array=malloc(sizeof(int)*N);
    for (i=0; i<N; i++)
        if (array==NULL)
        {
            printf("Not enough memory");
            exit(0);
        }
    FILE *f=fopen("save.txt", "w");
    for (i=0; i<N; i++)
    {
        printf("Give value %d of array: ", i+1);
        scanf("%d",&array[i]);
        fprintf(f,"%d", array[i]);
    }
    fclose(f);
    for (i=0;i<N;i++)
        for (j=N-1;j>=i+1;j--)
            if (array[j]>=array[j-1])
                swap(&array[j],&array[j-1]);
    for (i=0;i<N;i++)
        printf(" %d ", array[i]);
    int m=array[0];
    int mi=array[0];
    max(&m,N,array);
    min(&mi,N,array);
    printf("\n");
    printf("Maximum: %d \n", m);
    printf("Minimum: %d \n", mi);
    return 0;
}

void swap(int *a, int *b){
    int c;
    *a=c;
    *a=*b;
    *b=c;
    }

void max(int *m, int N,int p[N]){

int i;
for (i=0;i<N;i++)
        if (p[i]>*m)
            *m=p[i];
}

void min(int *mi, int N, int p[N]){
int i;
for (i=0;i<N;i++)
        if (p[i]<=*mi)
            *mi=p[i];
}