C语言结构体数组冒泡排序

#include<stdio.h>
#define N 3
int main()
{
	struct Book{
		char num[10];
		char name[10];
		char writer[10];
		float price;
	}books[N],bf;
	int i,j,min,f;
	for(i=0;i<N;i++)
		scanf("%s%s%s%f",books[i].num,books[i].name,books[i].writer,&books[i].price);
	for(i=0;i<N-1;i++)
	{
		min=books[i].price;
		for(j=i;j<N;j++)
		{
			if(min>books[j].price)
			{
				bf=books[j];
				books[j]=books[i];
				books[i]=bf;
			}
		}
	}
	printf("%s  %s  %s  %f",books[N-1].num,books[N-1].name,books[N-1].writer,books[N-1].price);
	return 0;
}