通讯录排序

https://pintia.cn/problem-sets/12/problems/347

#include <stdio.h>
#include <stdlib.h>
struct friend
{
    char name[11];
    int birthday;
    char phone_number[18];
};
void friends_sort(struct friend *p, int n);
int main(void)
{
    int i, n;
    struct friend *p;

    scanf("%d", &n);
    getchar(); //读回车符
    p = (struct friend *)calloc(n, sizeof(struct friend));
    for (i = 0; i < n; i++)
    {
        scanf("%s", (p + i)->name);
        scanf("%d", &((p + i)->birthday));
        getchar();
        gets((p + i)->phone_number);
    }

    friends_sort(p, n);

    for (i = 0; i < n; i++)
    {
        printf("%s %d %s
", (p + i)->name, (p + i)->birthday, (p + i)->phone_number);
    }

    return 0;
}
void friends_sort(struct friend *p, int n)
{
    struct friend temp;
    int i, k, index;
    for (i = 0; i < n - 1; i++)
    {
        index = i;
        for (k = i + 1; k < n; k++)
        {
            if ((p + k)->birthday < (p + index)->birthday)
            {
                index = k;
            }
        }
        temp = *(p + i);
        *(p + i) = *(p + index);
        *(p + index) = temp;
    }
}