Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
queue
#include<iostream> #define max 4 using namespace std; int queue[max]; int rear=0; int front=0; void fronte() { cout<<"\n"<<queue[front]<<"\n"; } void enqueue(int n) { if (max==rear) { printf("\nQueue is full\n"); return; } else { queue[rear] = n; rear++; } return; } void dequeue() { if (front == rear) { printf("\nQueue is empty\n"); return; } else { for (int i = 0; i < rear - 1; i++) { queue[i] = queue[i + 1]; } rear--; } return; } void display() { if(front==rear) cout<<"\nqueue is empty\n"; else { for(int i=front;i<rear;i++) cout<<queue[i]; } } int main() { enqueue(10); enqueue(20); enqueue(30); enqueue(40); dequeue(); cout<<"After poping:"; display(); cout<<"\nTop element after poping:"; fronte(); }
run
|
edit
|
history
|
help
0
Ineritance
不带头结点的单链表
Volume of Sphere with Powf
pbds
Problema2
Dar
Updated Linked Lists - 5/10/2017 V4.0
Boost phoenix. e.g 3 phoenix: functor
Point on a ray--2133
hilbert