数据结构day2 4.18

有若干个学校人员的信息，包括学生和教师。其中学生的数据包括:姓名、性别、职业slS、分数。教师的数据包括:姓名、性别、职业t/T、职务。要求用同一个表格来处理以上数据。
1，定义函数在堆区申请空间n
struct B*p= (struct B * )malloc(sizeof(struct B)*n );
2，定义函数实现录入学校人员信息，在输入分数或者职务是，需要判断职业。                           3，定义函数输出学校人员信息
4，定义函数计算学生平均成绩

5，定义函数计算老师的个数6，释放存储空间
 

#ifndef __TEST1_H__
#define __TEST1_H__

#include <stdio.h>
#include <stdlib.h>
typedef struct 
{
	char name[10];
	char sex;
	char job;
	union 
	{
		float score;
		char position[10];

	};
}person;
person *creat(int n);
void input( person *p,int n);
float jisuan(person *p,int n);
void output(person *p,int n);
int total(person *p,int n);
person * Free_space(person *p);

#endif
linux@linux:~/shuju/day2/test2$ cat test1.c
#include "test1.h"

person *creat(int n)
{
	 person *p = (person *)malloc(sizeof(person)*n);
	if(p == NULL)
	{
		printf("error");
		return NULL;
	}
	return p;
}
void input( person *p,int n)
{
	int i;
	for (i = 0;i<n;i++)
	{
		printf("please input name ");
		scanf("%s",(p+i)->name);
		printf("please input sex ");
		scanf(" %c",&(p+i)->sex);
		printf("please input job ");
		scanf(" %c",&(p+i)->job);
		if((p+i)->job == 's')
		{
			printf("please input score ");
			scanf("%f",&(p+i)->score);
		}
		else
		{
			printf("please input position ");
			scanf("%s",(p+i)->position);
		}
	}
}
float jisuan(person *p,int n)
{
	int i;
	float j = 0,sum = 0;	
	for(i = 0;i<n;i++)
	{
		if((p+i)->job == 's')
		{
			j++;
			sum += (p+i)->score;
		}
	}
	return sum / j;
}
void output(person *p,int n)
{
	int i;
	for (i = 0;i<n;i++)
	{
		printf("%s\t%c\t%c\t",(p+i)->name,(p+i)->sex,(p+i)->job);
		if((p+i)->job == 's')
		{
			printf("%.2f\n",(p+i)->score);
		}
		else 
		{
			printf("%s\n",(p+i)->position);
		}
	}
}
int total(person *p,int n)
{
	int i,j = 0;
	for (i = 0;i<n;i++)
	{
		if((p+i)->job == 't')
		j++;
	}	return j;
}
person *Free_space(person *p)
{
	if(p == NULL)
		return NULL;
	free(p);
	p = NULL;
}
linux@linux:~/shuju/day2/test2$ cat main.c 
#include "test1.h"

int main(int argc,char * argv[])
{
	int n;
	scanf("%d",&n);
	person *p = creat(n);
	input(p,n);
	output(p,n);
	printf("%.2f\n",jisuan(p,n));
	printf("%d\n",total(p,n));
	p = Free_space(p);
	return 0;
}
linux@linux:~/shuju/day2/test2$ gcc *.c
linux@linux:~/shuju/day2/test2$ ./a.out 
3
please input name w
please input sex m
please input job s
please input score 80
please input name l
please input sex w
please input job t
please input position laoshi
please input name y
please input sex m
please input job s
please input score 70
w	m	s	80.00
l	w	t	laoshi
y	m	s	70.00
75.00
1

定义商品结构体:名称，单价，个数

1，定义函数在堆区申请空间
2，定义函数实现输入
3，计算商品总价格

4，计算最贵的商品信息
5，输入—个商品名称，查找单价信息 

6，实现商品按单价排序
7，释放空间
 

linux@linux:~/shuju/day2/test3$ cat fun.h
#ifndef __FUN_H__
#define __FUN_H__

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
typedef struct
{
	char name[10];
	float price;
	int num;
}goods;
 goods *creat(int n);
void input(goods *p,int n);
float totil(goods *P,int n);
void max_totil(goods *p,int n);
void bobble(goods *p,int n);
goods*Free_space(goods *p);
void find(goods *p,int n);
#endif

 

linux@linux:~/shuju/day2/test3$ cat main.c
#include "fun.h"
int main(int argc,char * argv[])
{
	int n;
	scanf("%d",&n);
	goods *p = creat(n);
	input(p,n);
	printf("%.2f\n",totil(p,n));
	max_totil(p,n);
	find(p,n);
	bobble(p,n);
	Free_space(p);

	return 0;
}

 

linux@linux:~/shuju/day2/test3$ cat fun.c
#include "fun.h"

goods *creat(int n)
{
	goods *p = (goods *)malloc(sizeof(goods)*n);
		if(p == NULL)
		{
			printf("error");
			return NULL;
		}
	return p;
}
void input(goods *p,int n)
{
	int i;
	for (i = 0;i<n;i++)
	{
		printf("please input name ");
		scanf("%s",(p+i)->name);
		printf("please input price ");
		scanf("%f",&(p+i)->price);
		printf("please input num ");
		scanf("%d",&(p+i)->num);

	}
}
float totil(goods *p,int n)
{
	int i;
	float sum = 0;
	for (i = 0;i<n;i++)
	{
		sum += ((p+i)->price) * ((p+i)->num);
	}
	return sum;
}
void max_totil(goods *p,int n)
{
	int i,max;
	float t = p->price;
	for(i = 0;i<n;i++)
	{
		if((p+i)->price > t)
		{
			t = (p+i)->price;
			max = i;
		}
	}
	printf("%s\t%.2f\t%d\n",(p+max)->name,(p+max)->price,(p+max)->num);
}
void find(goods *p,int n)
{
	int i;
	char Name[20];
	printf("please enter the searched ");
	scanf("%s",Name);
	for (i = 0;i<n;i++)
	{
		if(strcmp(((p+i)->name),Name) == 0)
		{
			printf("%.2f\n",(p+i)->price);
		}
	}
}
void bobble(goods *p,int n)
{
	int i,j,count = 0;
	goods temp;
	for (i = 1;i<n;i++)
	{
		for (j = 0;j<n-i;j++)
		{
			count = 0;
			if((p+j)->price > (p+j+1)->price)
			{
				temp = *(p+j);
				*(p+j) = *(p+j+1);
				*(p+j+1) = temp;
				count++;
			}
		}
		if(count == 0)
			break;
	}
	for (i = 0;i<n;i++)
	{
		printf("%s\t%.2f\t%d\n",(p+i)->name,(p+i)->price,(p+i)->num);
	}
}
goods *Free_space(goods *p)
{
	if(p == NULL)
		return NULL;
	free(p);
	p = NULL;
	return p;
}

 

linux@linux:~/shuju/day2/test3$ gcc *.c
linux@linux:~/shuju/day2/test3$ ./a.out 
5
please input name apple
please input price 3
please input num 3
please input name milk
please input price 5
please input num 2
please input name banana
please input price 4
please input num 2
please input name cup
please input price 6
please input num 1
please input name paper
please input price 1
please input num 1
34.00
cup	6.00	1
please enter the searched apple
3.00
paper	1.00	1
apple	3.00	3
banana	4.00	2
milk	5.00	2
cup	6.00	1

 

 答案  32字节