将所有第一二三题模块化

homework1/test2.cpp

@@ -15,9 +15,9 @@ void swap(book &a, book &b) {
     b = temp;
 }
 
-void sort(book *arr, int size) {
-    for (int i = 0; i < size - 1; i++) {
-        for (int j = 0; j < size - 1 - i; j++) {
+void sort(book *arr, int length) {
+    for (int i = 0; i < length - 1; i++) {
+        for (int j = 0; j < length - 1 - i; j++) {
             if (arr[j].price < arr[j + 1].price) {
                 swap(arr[j], arr[j + 1]);
             }
@@ -25,18 +25,26 @@ void sort(book *arr, int size) {
     }
 }
 
-int main() {
-    book books[100];
-    int size = 0;
-    for (size = 0; true; size++) {
-        cin >> books[size].id >> books[size].name >> books[size].price;
-        if (books[size].id == "0" && books[size].name == "0" && books[size].price == 0) {
-            break;
+int input(book *books) {
+    int length = 0;
+    for (int length = 0; true; length++) {
+        cin >> books[length].id >> books[length].name >> books[length].price;
+        if (books[length].id == "0" && books[length].name == "0" && books[length].price == 0) {
+            return length;
         }
     }
-    sort(books, size);
-    for (int i = 0; i < size; i++) {
+}
+
+void output(book *books, int length) {
+    for (int i = 0; i < length; i++) {
         cout << books[i].id << "\t" << books[i].name << "\t" << fixed << setprecision(2) << books[i].price << endl;
     }
+}
+
+int main() {
+    book books[100];
+    int length = input(books);
+    sort(books, length);
+    output(books, length);
     return 0;
 }