Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
queue
Language:
Ada
Assembly
Bash
C#
C++ (gcc)
C++ (clang)
C++ (vc++)
C (gcc)
C (clang)
C (vc)
Client Side
Clojure
Common Lisp
D
Elixir
Erlang
F#
Fortran
Go
Haskell
Java
Javascript
Kotlin
Lua
MySql
Node.js
Ocaml
Octave
Objective-C
Oracle
Pascal
Perl
Php
PostgreSQL
Prolog
Python
Python 3
R
Rust
Ruby
Scala
Scheme
Sql Server
Swift
Tcl
Visual Basic
Layout:
Vertical
Horizontal
#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(); }
g++
Show compiler warnings
[
+
] Compiler args
[
+
]
Show input
Compilation time: 0.42 sec, absolute running time: 0.16 sec, cpu time: 0.01 sec, memory peak: 6 Mb, absolute service time: 0,75 sec
edit mode
|
history
|
discussion