通讯录排序

#include<stdio.h>
#include<stdlib.h>
typedef struct {
    char name[10];
    long int birth;
    char phone[17];
}pInfo;

int pInfoSort(pInfo *data, int n)
{
    int i, j;
    pInfo temp;
    for (i = 0; i < n; i++) {
        for (j = i + 1; j < n; j++) {
            if (data[i].birth > data[j].birth) {
                temp = data[i];
                data[i] = data[j];
                data[j] = temp;
            }
        }
    }
    for (i = 0; i < n; i++) {
        printf("%s  ", data[i].name);
        printf("%ld  ", data[i].birth);
        printf("%s\n", data[i].phone);
    }
    return 0;
}

int main()
{
    pInfo *data;
    int n, i;
    scanf("%d", &n);
    data = (pInfo*)malloc(sizeof(pInfo) * n);
    for (i = 0; i < n; i++) {
        scanf("%s", data[i].name);
        scanf("%ld", &data[i].birth);
        scanf("%s", data[i].phone); 
    }
    pInfoSort(data, n);
    system("pause");
    return 0;
}