Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<stdio.h>
- int MAXISIZE=3;
- int stack[3];
- int top=-1;
- int isempty()
- {
- if(top==-1)return 1;
- else return 0;
- }
- int isfull()
- {
- if(top==MAXISIZE-1)return 1;
- else return 0;
- }
- int peck()
- {
- return stack[top];
- }
- int push(int data)
- {
- top=top+1;
- stack[top]=data;
- }
- int pop()
- {
- int data;
- data=stack[top];
- top=top-1;
- return data;
- }
- int main()
- {
- if(isempty())printf("isempty\n");
- else printf("%d\n",top+1);
- if(!isfull())push(1);
- if(!isfull())push(2);
- if(!isfull())push(3);
- if(isempty())printf("isempty\n");
- else printf("not empty and size = %d\n",top+1);
- while(!isempty())
- {
- int data=pop();
- printf("%d\n",data);
- }
- }
- #include <stdio.h>
- int MAXSIZE = 3;
- int q[3];
- int front = 0;
- int rear = -1;
- int cnt = 0;
- int isempty()
- {
- if(!cnt)
- return 1;
- else
- return 0;
- }
- int isfull()
- {
- if(cnt == MAXSIZE)
- return 1;
- else
- return 0;
- }
- int peak()
- {
- return q[front];
- }
- int size()
- {
- return cnt;
- }
- int enque(int data)
- {
- if( /*isfull()==0 &&*/ rear == MAXSIZE-1)
- rear = -1;
- rear++;
- q[rear] = data;
- cnt++;
- }
- int deque()
- {
- int data = q[front++];
- if(front == MAXSIZE)
- {
- front = 0;
- }
- cnt--;
- return data;
- }
- void print()
- {
- printf("Whole deque\n");
- while(!isempty())
- {
- int data=deque();
- printf("%d\n",data);
- }
- }
- int main()
- {
- int a;
- while(1)
- {
- char str[10];
- scanf("%s",str);
- //printf("%s\n",str);
- if(str[1]=='u')
- {
- scanf("%d",&a);
- if(isfull())printf("queue is full\n");
- else enque(a);
- }
- else if(str[1]=='o')
- {
- if(isempty())
- printf("queue is empty\n");
- else{
- printf("%d\n",deque());
- }
- }
- else if(str[1]=='r')
- {
- print();
- }
- }
- /* while(!isempty())
- {
- int data=deque();
- printf("%d\n",data);
- }*/
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement