数据结构day2

#include "head.h"
Car create(int n)
{
	Car p  = (Car)malloc(sizeof(Car)*n);
	if ( NULL == p )
	{
		return NULL;
	}
	return p;
}
void input(Car p)
{
	int i = 0;
	for ( i = 0; i < 5; i++ )
	{
		printf("品牌\t");
		scanf("%s",(p+i)->name);
		printf("颜色\t");
		scanf("%s",(p+i)->corlor);
		printf("价格\t");
		scanf("%d",&(p+i)->price);
	}
}
void Bubble_sort(Car p)//冒泡排序
{
	int i = 0;
	for ( i = 1; i < 5; i++ )
	{
		for ( int j = 0; j < 5-i; j++ )
		{
			if ( (p+j)->price > (p+j+1)->price )
			{
				t = *(p+j);
				*(p+j) = *(p+j+1);
				*(p+j+1) = t;
			}
		}
	}
}
void output( Car p )
{
	printf("品牌\t颜色\t价格\t\n");
	int i = 0;
	for ( i = 0; i < 5; i++ )
	{
		printf("%s\t", (p+i)->name);
		printf("%s\t", (p+i)->corlor);
		printf("%d\t", (p+i)->price);
		printf("\n");
	}
}
Car free_sp( Car p )
{
	if ( NULL == p )
	{
		return p;
	}
	free(p);
	p == NULL;
	return p;
}