forked from lavinske/Data-Structures
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathNovusEventOrganizer
More file actions
167 lines (152 loc) · 3.27 KB
/
Copy pathNovusEventOrganizer
File metadata and controls
167 lines (152 loc) · 3.27 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
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
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
struct Event{
char name[31];
char city[9];
int year;
struct Event *prev, *next;
}*head, *tail, *curr;
struct Event *newData(char name[], char city[], int year){
struct Event *temp = (struct Event*)malloc(sizeof(struct Event));
strcpy(temp->name, name);
strcpy(temp->city, city);
temp->year = year;
temp->prev = temp->next = NULL;
return temp;
}
void push(char name[], char city[], int year){
struct Event *temp = newData(name, city, year);
if(!head){
//Kalo kosong
head = tail = temp;
}
else{
if(temp->year > head->year){
//Kalo lebih gede tahunnya, push head
temp->next = head;
head->prev = temp;
head = temp;
}
else if(temp->year <= tail->year){
//Kalo sama atau lebih kecil tahunnya, push tail
temp->prev = tail;
tail->next = temp;
tail = temp;
}
else{
//Loop sampai curr year lebih kecil dari temp
curr = head;
while(curr->year >= temp->year){
curr = curr->next;
}
//prev temp curr
//2012 2007 2005
temp->next = curr;
temp->prev = curr->prev;
curr->prev->next = temp;
curr->prev = temp;
}
}
}
struct Event pop(){
struct Event deleted = {"NULL", "NULL", -1};
if(head == NULL){
return deleted;
}
else{
struct Event deleted = *tail;
if(head->next == NULL){
free(head);
head = tail = NULL;
}
else{
tail = tail->prev;
free(tail->next);
tail->next = NULL;
}
return deleted;
}
}
void view(){
if(head){
curr = head;
printf("%-30s %-10s %s\n", "Event Name", "Event City", "Event Year");
while(curr){
printf("%-30s %-10s %d\n", curr->name, curr->city, curr->year);
curr = curr->next;
}
}
else{
printf("There is no event available...\n");
}
getchar();
}
void pop_all(){
while(head){
pop();
}
}
int main(){
char name[31], city[9];
char city_list[][10] = {"Jakarta", "Bandung", "Semarang"};
int menu, year;
do{
system("cls");
printf ("1. View Event List\n"
"2. Register New Event\n"
"3. Remove Oldest Event\n"
"4. Exit\n");
do{
printf(">> ");
scanf("%d", &menu); getchar();
}while(menu < 1||menu > 4);
switch(menu){
case 1:
system("cls");
view();
break;
case 2:
int length;
do{
printf("Input event name: ");
scanf("%[^\n]", &name); getchar();
length = strlen(name);
}while(length<8||length>30);
do{
printf("Input event year [2000-2015]: ");
scanf("%d", &year); getchar();
}while(year<2000||year>2015);
bool valid_city;
do{
strcpy(city, "");
printf("Input event city [Jakarta/Bandung/Semarang]: ");
scanf("%[^\n]", &city); getchar();
valid_city = false;
for (int i = 0; i < 3; i++){
if(strcmp(city, city_list[i])==0){
valid_city = true;
break;
}
}
}while(!valid_city);
push(name, city, year);
printf("Data has been added!\n");
getchar();
break;
case 3:
struct Event deleted = pop();
printf("Removed Data : \n");
printf("Event Name : %s\n", deleted.name);
printf("Event City : %s\n", deleted.city);
printf("Event Year : %d\n", deleted.year);
getchar();
break;
}
}while(menu != 4);
pop_all();
printf("All data has been deleted...\n");
printf("Exiting program...\n");
getchar();
return 0;
}