指向结构体的指针作业

#include <stdio.h>
#define N 5
struct Student {
    char name[20];
    int num;
    char sex;
    int age;
    char department[20];
};
void inputStudent(struct Student *p, int n);
void sortStudent(struct Student *p, int n);
void swap(struct Student *p, struct Student *q);
void outputStudent(struct Student *p, int n);
int main(void)
{
    struct Student student[N];
    
    inputStudent(student, N);
    sortStudent(student, N);
    outputStudent(student, N);
    
    return 0;
}
void inputStudent(struct Student *p, int n)
{
    int i;
    for (i = 0; i < n; i++, p++) {
        printf("请输入第%d个学生姓名：", i + 1);
        scanf("%s", p->name);
        printf("请输入第%d个学生学号：", i + 1);
        scanf("%d", &(p->num));
        getchar();
        printf("请输入第%d个学生性别：", i + 1);
        scanf("%c", &(p->sex));
        printf("请输入第%d个学生院系：", i + 1);
        scanf("%s", p->department);
        getchar();
    }
}
void sortStudent(struct Student *p, int n)
{
    struct Student *end_p, *index_p, *temp_p;
    
    //指向最后一个学生的指针
    end_p = p + n -1;
    //遍历结构体数组
    for (; p < end_p; p++) {
        index_p = p;
        //找出最小值
        for (temp_p = index_p + 1; temp_p <= end_p; temp_p++) {
            if (temp_p->num < index_p->num) {
                index_p = temp_p;
            }
        }
        if (index_p != p) {
            swap(p, index_p);
        }
    }
}
void swap(struct Student *p, struct Student *q)
{
    struct Student temp;
    
    temp = *p;
    *p = *q;
    *q = temp;
}
void outputStudent(struct Student *p, int n)
{
    struct Student *end_p;
    
    end_p = p + n - 1;
    for (; p <= end_p; p++) {
        printf("%s\t%d\t%c\t%s\n", p->name, p->num, p->sex ,p->department);
    }
}