-
Notifications
You must be signed in to change notification settings - Fork 0
/
lib.cpp
232 lines (199 loc) · 5.73 KB
/
lib.cpp
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
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
struct Book {
int id;
string title;
string author;
bool available;
};
const int MAX_BOOKS = 100;
Book books[MAX_BOOKS];
int numBooks = 0;
// Add New Book: Using Array
void addNewBook() {
if (numBooks >= MAX_BOOKS) {
cout << "Maximum book capacity reached." << endl;
return;
}
Book newBook;
cout << "Enter book ID: ";
cin >> newBook.id;
cin.ignore();
cout << "Enter book title: ";
getline(cin, newBook.title);
cout << "Enter book author: ";
getline(cin, newBook.author);
newBook.available = true;
books[numBooks] = newBook;
numBooks++;
cout << "Book added successfully." << endl;
}
// Search for a Book: Using Linear Search
void searchBook() {
string keyword;
cout << "Enter book title or ID to search: ";
cin.ignore();
getline(cin, keyword);
bool found = false;
for (int i = 0; i < numBooks; i++) {
if (books[i].title == keyword || to_string(books[i].id) == keyword) {
cout << "Book found!" << endl;
cout << "ID: " << books[i].id << endl;
cout << "Title: " << books[i].title << endl;
cout << "Author: " << books[i].author << endl;
cout << "Status: " << (books[i].available ? "Available" : "Issued") << endl;
found = true;
break;
}
}
if (!found) {
cout << "Book not found." << endl;
}
}
// Issue a Book: Using Queue
void issueBook() {
int bookID;
cout << "Enter book ID to issue: ";
cin >> bookID;
bool found = false;
for (int i = 0; i < numBooks; i++) {
if (books[i].id == bookID) {
if (books[i].available) {
books[i].available = false;
cout << "Book issued successfully." << endl;
} else {
cout << "Book is already issued." << endl;
}
found = true;
break;
}
}
if (!found) {
cout << "Book not found." << endl;
}
}
// Return a Book
void returnBook() {
int bookID;
cout << "Enter book ID to return: ";
cin >> bookID;
bool found = false;
for (int i = 0; i < numBooks; i++) {
if (books[i].id == bookID) {
if (!books[i].available) {
books[i].available = true;
cout << "Book returned successfully." << endl;
} else {
cout << "Book is already available." << endl;
}
found = true;
break;
}
}
if (!found) {
cout << "Book not found." << endl;
}
}
// List All Books: Using Quick Sort
int partition(Book arr[], int low, int high) {
Book pivot = arr[high];
int i = low - 1;
for (int j = low; j <= high - 1; j++) {
if (arr[j].id < pivot.id) {
i++;
swap(arr[i], arr[j]);
}
}
swap(arr[i + 1], arr[high]);
return i + 1;
}
void quickSort(Book arr[], int low, int high) {
if (low < high) {
int pi = partition(arr, low, high);
quickSort(arr, low, pi - 1);
quickSort(arr, pi + 1, high);
}
}
void listAllBooks() {
if (numBooks == 0) {
cout << "No books available." << endl;
return;
}
cout << "Listing all books:" << endl;
cout << "------------------" << endl;
quickSort(books, 0, numBooks - 1);
for (int i = 0; i < numBooks; i++) {
cout << "ID: " << books[i].id << endl;
cout << "Title: " << books[i].title << endl;
cout << "Author: " << books[i].author << endl;
cout << "Status: " << (books[i].available ? "Available" : "Issued") << endl;
cout << "------------------" << endl;
}
}
// Delete a Book
void deleteBook() {
int bookID;
cout << "Enter book ID to delete: ";
cin >> bookID;
bool found = false;
for (int i = 0; i < numBooks; i++) {
if (books[i].id == bookID) {
for (int j = i; j < numBooks - 1; j++) {
books[j] = books[j + 1];
}
numBooks--;
found = true;
cout << "Book deleted successfully." << endl;
break;
}
}
if (!found) {
cout << "Book not found." << endl;
}
}
int main() {
int choice;
do {
cout << "Library Management System" << endl;
cout << "------------------------" << endl;
cout << "1. Add New Book" << endl;
cout << "2. Search for a Book" << endl;
cout << "3. Issue a Book" << endl;
cout << "4. Return a Book" << endl;
cout << "5. List All Books" << endl;
cout << "6. Delete a Book" << endl;
cout << "0. Exit" << endl;
cout << "------------------------" << endl;
cout << "Enter your choice: ";
cin >> choice;
switch (choice) {
case 1:
addNewBook();
break;
case 2:
searchBook();
break;
case 3:
issueBook();
break;
case 4:
returnBook();
break;
case 5:
listAllBooks();
break;
case 6:
deleteBook();
break;
case 0:
cout << "Exiting the program." << endl;
break;
default:
cout << "Invalid choice. Please try again." << endl;
}
cout << endl;
} while (choice != 0);
return 0;
}