data-structures-and-algorithms/实验一/test2.cpp

#include <iostream>

using namespace std;

typedef struct
{
    string id;
    string name;
    double price;
} book;

void swap(book &book1, book &book2)
{
    book temp = book1;
    book1 = book2;
    book2 = temp;
}

int length_of(book books[]){
	return sizeof(books[0])/sizeof(books);
}

book sort(book books[])
{
    for(int i=0;i<length_of(books);i++){
		for(int j=0;j<length_of(books)-1-i;j++){
			if(books[i]<books[i+1]){
				swap(books[i],books[i+1])
			}
		}
	}
}

int main(){
	book books[100];
	for(int i=0,1;i++){
		cin>>
	}
	
}
    
}