Sortare crescator a elementelor unui vector

#include <stdio.h>
#include <conio.h>
#include <stdlib.h>

void citireE(int n , int *p) {
    int i;
    for (i = 0; i < n; i++) {
        printf("Elemnt %d= ", i);
        scanf_s("%d", &p[i]);
    }
}

void afisareE(int n, int *p) {
    int i;
    printf("\nV=[");
    for (i = 0; i < n; i++) {
        printf("%d ", p[i]);
    }
    printf("]");
}

void sortare(int n, int *p) {
    int i, j, schimb;

    for (i = 0; i < n; i++)
        for (j = i + 1; j < n; j++){
            if (p[i]>p[j]){
                schimb = p[i];
                p[i] = p[j];
                p[j] = schimb;

            }
        }
}


int *alocare(int n) {
    int *p;

    if ((p=(int *) malloc (sizeof(int)*n)) == NULL) {
        printf("Nu ai suficienta memorie!");
        _getch();
        exit(0);

    }
}

void main() {
    int n, *p;

    printf("Introduceti numarul de elemente:");
    scanf_s("%d", &n);

    p = alocare(n);

    citireE(n, p);
    afisareE(n, p);

    sortare(n, p);
    afisareE(n, p);

    _getch();
}