-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathProjectTwo.cpp
More file actions
125 lines (103 loc) · 2.98 KB
/
Copy pathProjectTwo.cpp
File metadata and controls
125 lines (103 loc) · 2.98 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm> // for sort
#include <string>
using namespace std;
struct Course {
string courseNumber;
string name;
vector<string> prerequisites;
};
vector<string> tokenize(const string& s, const string& del = ",") {
vector<string> tokens;
size_t start = 0, end = s.find(del);
while (end != string::npos) {
tokens.push_back(s.substr(start, end - start));
start = end + del.size();
end = s.find(del, start);
}
tokens.push_back(s.substr(start, end - start));
return tokens;
}
vector<Course> loadCoursesFromFile() {
ifstream fin("abcu.txt", ios::in);
vector<Course> courses;
string line;
while (getline(fin, line)) {
if (line == "-1") break;
Course course;
vector<string> tokenizedInformation = tokenize(line);
course.courseNumber = tokenizedInformation[0];
course.name = tokenizedInformation[1];
for (int i = 2; i < tokenizedInformation.size(); ++i) {
course.prerequisites.push_back(tokenizedInformation[i]);
}
courses.push_back(course);
}
fin.close();
return courses;
}
void printCourse(const Course& course) {
cout << "Course Number: " << course.courseNumber << endl;
cout << "Course Name: " << course.name << endl;
cout << "Prerequisites: ";
for (const auto& prerequisite : course.prerequisites) {
cout << prerequisite << " ";
}
cout << "\n\n";
}
void printCourseList(vector<Course>& courses) {
sort(courses.begin(), courses.end(),
[](const Course& a, const Course& b) {
return a.courseNumber < b.courseNumber;
});
for (const auto& course : courses) {
printCourse(course);
}
}
void searchCourse(const vector<Course>& courses) {
string courseNumber;
cout << "Enter courseNumber: ";
cin >> courseNumber;
bool found = false;
for (const auto& course : courses) {
if (course.courseNumber == courseNumber) {
found = true;
printCourse(course);
break;
}
}
if (!found) {
cout << "Course with given course number not found\n";
}
}
int main() {
vector<Course> courses;
cout << "1. Load Data Structure\n";
cout << "2. Print Course List\n";
cout << "3. Print Course\n";
cout << "4. Exit\n";
int choice;
do {
cout << "\nEnter your choice: ";
cin >> choice;
switch (choice) {
case 1:
courses = loadCoursesFromFile();
break;
case 2:
printCourseList(courses);
break;
case 3:
searchCourse(courses);
break;
case 4:
cout << "Exit\n";
break;
default:
cout << "Invalid Choice\n";
}
} while (choice != 4);
return 0;
}