C language for basic operations of sequential Queue (cyclic queue)

Source: Internet
Author: User

Only a few major operations, such as destruction and clearing, were written.

#include <stdio.h>#include <stdlib.h>#define OK 1#define ERROR 0#define QUEUE_SIZE 100typedef  int Status;typedef  int ElemType;typedef struct Qnode{        ElemType *base;        int front;        int rear;        int count;} Qnode;Status Init(Qnode &qq){       qq.base = (ElemType*)malloc(QUEUE_SIZE * sizeof(ElemType));       if (qq.base == NULL) return ERROR;       qq.front = 0;       qq.rear = 0;       qq.count = 0;       return OK;}Status EnQueue(Qnode &qq, ElemType e){              if ((qq.rear + 1) % QUEUE_SIZE == qq.front)       return ERROR;       qq.base[qq.rear] = e;       qq.rear = (qq.rear + 1)%QUEUE_SIZE;       qq.count++;       return OK;}Status DeQueue(Qnode &qq, ElemType &e){       if (qq.rear == qq.front)       return ERROR;       e = qq.base[qq.front];       qq.front = (qq.front + 1) % QUEUE_SIZE;       qq.count--;       return OK;}Status GetTop(Qnode &qq, ElemType &e){       if (qq.rear == qq.front)       return ERROR;       e = qq.base[qq.front];       return OK;}Staus Destroy(Qnode qq){      free(qq.base);      qq.base = NULL;      qq.count = 0;      return OK;}int main(){    Qnode qq;    Init(qq);    int m, i;    printf("how many nums?\n");    scanf("%d", &m);    for (i = 0; i < m; i++)    {        int e;        scanf("%d", &e);        EnQueue(qq, e);    }    int e;    GetTop(qq, e);    printf("%d\n" , e);    for (i = 0; i < m; i++)    {        DeQueue(qq, e);        printf("%d ", e);    }    printf("\n");    system ("pause");    return 0;}

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.