-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmain.c
145 lines (134 loc) · 2.93 KB
/
main.c
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
#include<stdio.h>
#include<stdlib.h>
// #include<Windows.h>
#include "dynamicQueue.h"
struct student newStudent(){
struct student Student;
printf("=-=-=-=-=-=-=-=-=-New Student-=-=-=-=-=-=-=-=-=\n");
printf("Name:\n");
fgets(Student.name, sizeof(Student.name), stdin);
printf("Enrollment (int):\n");
scanf("%d", &Student.enrollment);
printf("Insert the first pontuation:\n");
scanf("%f", &Student.p1);
printf("Insert the second pontuation:\n");
scanf("%f", &Student.p2);
printf("Insert the third pontuation:\n");
scanf("%f", &Student.p3);
return Student;
}
void show_student(struct student *student){
printf("\nName: %s", student->name);
printf("Enrollment: %d\n", student->enrollment);
printf("Pontuation 1: %.2f\n", student->p1);
printf("Pontuation 2: %.2f\n", student->p2);
printf("Pontuation 3: %.2f\n",student->p3);
}
void show_options(){
printf("\n=-=-=-=-=-=-=-=-=-Static Queue-=-=-=-=-=-=-=-=-=\n");
printf("[1] Push\n");
printf("[2] Pop\n");
printf("[3] Size\n");
printf("[4] Empty\n");
printf("[5] Full\n");
printf("[6] Front\n");
printf("[7] Back\n");
printf("[8] Show All\n");
printf("[0] EXIT\n");
}
void menu(){
dynamicQueue* q = NULL;
int option;
int loop = 1;
struct student Student;
q = create();
while(loop){
show_options();
while(1){
printf("\nType: ");
scanf("%d", &option);
getchar();
if (option >= 0 && option <= 12) break;
else{
printf("\nError: Invalid Option\n");
}
}
switch (option){
case 0:
release(q);
loop = 0;
break;
case 1:
if(push(q, newStudent())){
printf("\nSuccess!\n");
}else{
printf("\nFailed!\n");
}
break;
case 2:
if(pop(q)){
printf("\nSuccess!\n");
}else{
printf("\nFailed!\n");
}
break;
case 3:
if(size(q) != -1){
printf("\nThe size of array is %d!\n", size(q));
}else{
printf("\nError\n");
}
break;
case 4:
if(empty(q) != -1){
if(empty(q)){
printf("\nThe array is empty!\n");
}else{
printf("\nThe array is not empty!\n");
}
}else{
printf("\nError\n");
}
break;
case 5:
if(full(q) != -1){
if(full(q)){
printf("\nThe array is full!\n");
}else{
printf("\nThe array is not full!\n");
}
}else{
printf("\nError\n");
}
break;
case 6:
printf("Front:\n");
if(front(q, &Student)){
show_student(&Student);
}else{
printf("\nError\n");
}
break;
case 7:
printf("Back:\n");
if(back(q, &Student)){
show_student(&Student);
}else{
printf("\nError\n");
}
break;
case 8:
if(!show(q)){
printf("\nFailed!\n");
}
break;
default:
break;
}
// Sleep(2000);
}
}
int main(){
menu();
return 0;
}