C语言 结构体与指针的嵌套训练——师生按名字降序排序

#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <stdlib.h>
#include <string.h>

typedef struct Teacher
{
	char* tName;//导师
	char** stu;//学生
	int age;
}Teacher;

//在createTeacher中分配空间
int createTeacher(Teacher** p/*out*/, int n1, int n2)
{
	if (p == NULL)
	{
		return -1;
	}

	Teacher* tmp = (Teacher*)malloc(n1 * sizeof(Teacher));
	if (tmp == NULL)
	{
		return -2;
	}
	int i = 0, j = 0;
	for (i = 0; i < n1; i++)
	{
		//导师
		tmp[i].tName = (char*)malloc(30);
		//学生
		char** s = (char**)malloc(n2 * sizeof(char*));
		for (j = 0; j < n2; j++)
		{
			s[j] = (char*)malloc(30);
		}
		tmp[i].stu = s;
	}

	*p = tmp;

	return 0;
}

//给成员赋值
void initTeacher(Teacher* p, int n1, int n2)
{
	if (p == NULL)
	{
		return -1;
	}
	int i = 0, j = 0;
	char buf[30];
	for (i = 0; i < n1; i++)
	{
		//导师名字，年龄
		sprintf(buf, "teacher%d%d%d", i, i, i);
		strcpy(p[i].tName, buf);
		p[i].age = 30 + i * 2;

		//学员
		for (j = 0; j < n2; j++)
		{
			sprintf(buf, "stu%d%d%d%d", i, i, j, j);
			strcpy(p[i].stu[j], buf);
		}
	}
}

//打印结构体成员信息
void printTeacher(Teacher* p, int n1, int n2)
{
	if (p == NULL)
	{
		return -1;
	}
	int i = 0, j = 0;
	for (i = 0; i < n1; i++)
	{
		printf("%s[%d]:\n", p[i].tName, p[i].age);

		for (j = 0; j < n2; j++)
		{
			printf("\t%s", p[i].stu[j]);
		}
		printf("\n");
	}
}

//根据导师名字降序排序
void sortTeacher(Teacher* p, int n1)
{
	if (p == NULL)
	{
		return -1;
	}
	int i = 0, j = 0;
	Teacher tmp;
	for (i = 0; i < n1 - 1; i++)
	{
		for (j = i + 1; j < n1; j++)
		{
			if (strcmp(p[i].tName, p[j].tName) < 0)
			{
				tmp = p[i];
				p[i] = p[j];
				p[j] = tmp;
			}
		}
	}
}

//释放空间，在函数内部把p赋值为NULL
void freeTeacher(Teacher** p, int n1, int n2)
{
	if (p == NULL)
	{
		return -1;
	}

	Teacher* tmp = *p;
	int i = 0, j = 0;
	for (i = 0; i < n1; i++)
	{
		//释放导师内存空间
		if (tmp[i].tName != NULL)
		{
			free(tmp[i].tName);
			tmp[i].tName = NULL;
		}

		//释放学生内存空间
		for (j = 0; j < n2; j++)
		{
			if (tmp[i].stu[j] != NULL)
			{
				free(tmp[i].stu[j]);
				tmp[i].stu[j] = NULL;
			}
		}

		if (tmp[i].stu != NULL)
		{
			free(tmp[i].stu);
			tmp[i].stu = NULL;
		}
	}

	if (tmp != NULL)
	{
		free(tmp);
		*p = NULL;//tmp = NULL;
	}
}

int main()
{
	int ret = 0;
	int n1 = 3;
	int n2 = 3;
	Teacher* p = NULL;

	ret = createTeacher(&p, n1, n2);
	if (ret != 0)
	{
		printf("createTeacher() Error:%d\n", ret);
		return ret;
	}

	initTeacher(p, n1, n2);//给成员赋值

	//打印成员，排序前
	printf("排序前：\n");
	printTeacher(p, n1, n2);

	//根据导师名字降序排序
	sortTeacher(p, n1, n2);

	//打印成员，排序后
	printf("\n排序后：\n");
	printTeacher(p, n1, n2);

	printf("\n");
	system("pause");
	return 0;
}