基于链式存储结构的图书信息表的排序
描述
定义一个包含图书信息(书号、书名、价格)的链表,读入相应的图书数据完成图书信息表的创建,然后将图书按照价格降序排序,逐行输出排序后每本图书的信息。
输入
输入n+1行,前n行是n本图书的信息(书号、书名、价格),每本图书信息占一行,书号、书名、价格用空格分隔,价格之后没有空格。最后第n+1行是输入结束标志:0 0 0(空格分隔的三个0)。其中书号和书名为字符串类型,价格为浮点数类型。
输出
总计n行,每行是一本图书的信息(书号、书名、价格),书号、书名、价格用空格分隔。其中价格输出保留两位小数。
输入样例 1
9787302257646 Data-Structure 35.00 9787302164340 Operating-System 50.00 9787302219972 Software-Engineer 32.00 9787302203513 Database-Principles 36.00 9787810827430 Discrete-Mathematics 36.00 9787302257800 Data-Structure 62.00 9787811234923 Compiler-Principles 62.00 9787822234110 The-C-Programming-Language 38.00 0 0 0
输出样例 1
9787302257800 Data-Structure 62.00 9787811234923 Compiler-Principles 62.00 9787302164340 Operating-System 50.00 9787822234110 The-C-Programming-Language 38.00 9787302203513 Database-Principles 36.00 9787810827430 Discrete-Mathematics 36.00 9787302257646 Data-Structure 35.00 9787302219972 Software-Engineer 32.00
#include<iostream>
#include<string>
#include<iomanip>
#define Maxsize 100
using namespace std;
struct Book {
string no;
string name;
double price;
};
typedef struct LNode {
Book data;
struct LNode* next;
}LNode, *LinkList;
void InitLinkList(LinkList &L) {
L = new LNode;
L->next = NULL;
}
LinkList Insert(LinkList& L) {
int n = 0;
Book a;
LNode* s, * r = L;
while (1) {
cin >> a.no >> a.name >> a.price;
if (a.no == "0" && a.name == "0" && a.price == 0) {
break;
}
n++;
s = new LNode;
s->data = a;
r->next = s;
r = s;
}
r->next = NULL;
//排序
for (int i = 0; i < n; i++)
{LNode* p = L->next;
Book temp;
while (p->next!=NULL) {
if (p->data.price < p->next->data.price) {
temp = p->next->data;
p->next->data = p->data;
p->data = temp;
}
p = p->next;
}
}
return L;
}
void output(LinkList& L) {
LNode* p = L->next;
while (p!=NULL) {
cout << p->data.no << " " << p->data.name << " " << fixed << setprecision(2) << p->data.price << endl;
p = p->next;
}
}
int main() {
LinkList L;
InitLinkList(L);
Insert(L);
output(L);
return 0;
}