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
| #include <stdio.h>
#define MAX_QUEUE_SIZE 100
typedef struct{
int key;
}element;
element queue[MAX_QUEUE_SIZE];
int top = -1;
int rear = -1;
void qadd(int *rear, element item);
element qdelete(int *front,int rear);
int main (int argc, const char * argv[])
{
element i1={1},i2={2},i3={3},i4={4};
qadd(&rear,i1);
qadd(&rear,i2);
qadd(&rear,i3);
qadd(&rear,i4);
element temp = qdelete(&top, rear);
printf("%d \n",temp.key);
return 0;
}
void qadd(int *rear, element item){
if (*rear == MAX_QUEUE_SIZE){
// queue_full();
// return;
}
*rear = (*rear + 1) % MAX_QUEUE_SIZE;
queue[++(*rear)] = item;
}
element qdelete(int *front,int rear){
if(*front == rear){
// return queue_empty();
}
*front = (*front + 1) % MAX_QUEUE_SIZE;
return queue[++(*front)];
}
|