queuearray.c

#include<stdio.h>
#include<stdlib.h>
struct queue{
    int r,f;
    int *arr;
    int size;
};
int full(struct  queue*q){
    if(q->r == q->size-1){
        return 1;
    }
    return 0;
}
int empty(struct queue*q){
    if(q->r== q->f){
        return 1;
    }
    return 0;
}
void enqueue(struct queue *q, int data){
    if( full(q)){
        printf("underflow\n");
    }
    else{
        q->r++;
        q->arr[q->r] = data;
    }
}
int dequeue(struct queue* q){
    int a = -1;
    if(empty(q)){
        printf("overflow\n");
    }
    else{
        q->f++;
        a = q->arr[q->f];
    }
    return a;
}
int display(struct queue *q){
    for(int i = (q->f+1); i<= q->r; i++){
        printf("%d elements of queue is %d\n",i, q->arr[i]);
    }
    printf ("\n");
}
int main(){
    struct queue q;
    q.size = 100;
    q.f = q.r = -1;
    q.arr = (int*)malloc(q.size*sizeof(int));
    enqueue(&q,90);
    enqueue(&q,80);
    enqueue(&q,70);
    printf("element dequeued is %d\n", dequeue(&q));
    if(empty(&q)){
        printf("queue is empty \n");
    }
    if(full(&q)){
    printf("queue is full \n");
    }
    display(&q);
    return 0;
}