课程编号管理系统

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

typedef struct 
{
	char number[20];
	char name[20];
	char style[20];
	int time[2];
	int score;
	int n;
}COURSE;
COURSE course[100];
int N=0;

void add()
{
	system("cls");
	printf("请输入输入课程编号\n");
	scanf("%s",&course[N].number);
	printf("请输入输入课程名\n");
	scanf("%s",&course[N].name);
	printf("请输入输入课程类型\n");
	scanf("%s",&course[N].style);
	printf("请输入输入课程授课学时\n");
	scanf("%d",&course[N].time[0]);
	printf("请输入输入课程实验或上机学时\n");
	scanf("%d",&course[N].time[1]);
	printf("请输入输入课程学分\n");
	scanf("%d",&course[N].score);
	printf("请输入输入课程开课学期\n");
	scanf("%d",&course[N].n);
	N++;
	printf("新增课程成功!\n");
	system("pause");
}


void display()
{
	int i;
	system("cls");
	if(0==N)
	{
		printf("无课程信息!\n");
	}
	else
	{
		printf("%-10s%-20s%-10s%-10s%-16s%-10s%-4s\n","编号","课程名","类型","授课学时","上机或实验学时","学分","学期");
		for(i=0;i<N;i++)
		{
			printf("%-10s%-20s%-10s%-10d%-16d%-10d%-4d\n",course[i].number,course[i].name,course[i].style,course[i].time[0],course[i].time[1],course[i].score,course[i].n);
		}
	}
	system("pause");
}

void sort()
{
	COURSE temp;
	int i,j;
		for(i=0;i<N;i++)
		{
			for(j=i+1;j<N;j++)
			{
				if( strcmp(course[i].number,course[j].number)>0 )
				{
					temp=course[j];
					course[j]=course[i];
					course[i]=temp;
				}
			}
		}
}

void serach()
{
	int i;
	char temp[30];
	system("cls");
	printf("请输入要查询的课程编号:\n");
	scanf("%s",temp);
	printf("%-10s%-20s%-10s%-10s%-16s%-10s%-4s\n","编号","课程名","类型","授课学时","上机或实验学时","学分","学期");
	for(i=0;i<N;i++)
	{
		if(!strcmp(course[i].number,temp))
		{
			printf("%-10s%-20s%-10s%-10d%-16d%-10d%-4d\n",course[i].number,course[i].name,course[i].style,course[i].time[0],course[i].time[1],course[i].score,course[i].n);
		}
	}
	system("pause");
}


int main()
{
	int n;
	do
	{
		system("cls");
		printf("1:课程信息录入\n");
		printf("2:课程信息浏览\n");
		printf("3:按课程编号排序\n");
		printf("4:按课程编号查询\n");
		printf("0:退出\n");
		printf("请选择:\n");
		scanf("%d",&n);
		while(n<0||n>4)
		{
			printf("输入错误,请重新输入!\n");
			scanf("%d",&n);
		}
		switch(n)
		{
		case 1:
			add();
			break;
		case 2:
			display();
			break;
		case 3:
			sort();
			display();
			break;
		case 4:
			serach();
			break;
		}
	}while(n!=0);
	return 0;
}