BJFU——205基于顺序存储结构的图书信息表的排序

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

 #define MAX 1000
 typedef struct{
    double no;
    char name[MAX];
    double price;

 }Book;

 int createList(Book b[]);
 void traverse(Book b[],int len);
 void sortList(Book b[],int len);
 int main()
 {
    Book book[MAX];

    int len;
    len = createList(book);
    sortList(book,len);
    traverse(book,len);

    return ;
 }

 int createList(Book b[])
 {
    int i=;
    while()
    {
       scanf("%lf",&b[i].no);
       scanf("%s",&b[i].name);
       scanf("%lf",&b[i].price);

       if(b[i].no==&&b[i].name[]==''&&b[i].price==)
         break;

        i++;

    }

    return i;
 }

 void traverse(Book b[],int len)
 {
     for(int i=;i<len;i++)
     {
         printf("%.0lf ",b[i].no);
         printf("%s ",b[i].name);
         printf("%.2f",b[i].price);
         printf("\n");
     }

 }

 void sortList(Book b[],int len)
 {
     int i,j;
     Book t;

     for(i=;i<len-;i++)
     {
         int max_index = i;

         for(j=i+;j<len;j++)
         {
             if(b[j].price >= b[max_index].price)
                 max_index = j;
         }
         if(i!=max_index)
         {
             t = b[i];
             b[i] = b[max_index];
             b[max_index] = t;

         }
     }
 }