-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathqueue.c
More file actions
executable file
·119 lines (98 loc) · 2.3 KB
/
queue.c
File metadata and controls
executable file
·119 lines (98 loc) · 2.3 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
#include <stdio.h>
#include <stdlib.h>
struct element {
int value;
struct element* next;
};
struct queue {
struct element* first;
unsigned int size;
};
typedef struct element element;
typedef struct queue queue;
element*
new_element(int value) {
element* tmp = malloc(sizeof(element));
tmp->value = value;
tmp->next = NULL;
return tmp;
}
void
print_element(element* tmp) {
printf("%d ", tmp->value);
}
void
initialize(queue* user_queue) {
user_queue->first = NULL;
user_queue->size = 0;
}
int
is_empty(queue* user_queue) {
return !user_queue->size;
}
void
show(queue* user_queue) {
element* aux = malloc(sizeof(element));
aux = user_queue->first;
printf("Size: %d\n", user_queue->size);
while (aux) {
print_element(aux);
aux = aux->next;
}
printf("\n");
}
void
enqueue(queue* user_queue, element* tmp) {
if (is_empty(user_queue)) {
user_queue->first = tmp;
} else {
element* aux = malloc(sizeof(element));
aux = user_queue->first;
while (aux->next)
aux = aux->next;
aux->next = tmp;
}
user_queue->size++;
}
void
dequeue(queue* user_queue) {
if (is_empty(user_queue))
return;
element* aux = malloc(sizeof(element));
aux = user_queue->first->next;
free(user_queue->first);
user_queue->first = NULL;
user_queue->first = aux;
user_queue->size--;
}
int
main(int argc, char const *argv[]) {
int number, choice;
queue my_queue;
initialize(&my_queue);
do {
printf("\t\tQueue Menu\n\t1. Enque \t2. Deque\n\t3. Display\t0. Exit\n");
printf("\nEnter Choice 0─3: ");
scanf("%d", &choice);
switch (choice) {
case 0:
break;
case 1:
printf("\nPlease, enter a number: ");
scanf("%d", &number);
enqueue(&my_queue, new_element(number));
break;
case 2:
dequeue(&my_queue);
break;
case 3:
printf("\n");
show(&my_queue);
break;
default:
printf("Invalid choice, please try again.\n\n");
}
} while (choice != 0);
printf("Thank you!\n");
return 0;
}