From 6c799a53856eaadea1f60f2bdd09d2684988cc70 Mon Sep 17 00:00:00 2001 From: Siddharth Batra Date: Sun, 30 Sep 2018 23:42:13 +0530 Subject: [PATCH 1/2] Queue implementation using array in C++ --- CPP/algorithms/queue.cpp | 41 ++++++++++++++++++++++++++++++++++++++++ 1 file changed, 41 insertions(+) create mode 100644 CPP/algorithms/queue.cpp diff --git a/CPP/algorithms/queue.cpp b/CPP/algorithms/queue.cpp new file mode 100644 index 0000000..2da4c77 --- /dev/null +++ b/CPP/algorithms/queue.cpp @@ -0,0 +1,41 @@ +/*Queue Implementation using Arrays in C++ + created by DarkSun27*/ + +#include +#define size 100 +using namespace std; + +int arr[size],front=0,rear=0; +void enque(int value) +{ + if(rear==size) + { + cout<<"Size of queue is full"; + return; + } + arr[rear++]=value; +} +int deque() +{ + if(front>t; + for(int i=0;i>opt; // 1 for enque and 2 fr deque + switch(opt) + { + case 1:int value;cin>>value;enque(value);break; + case 2:cout< Date: Mon, 1 Oct 2018 00:39:58 +0530 Subject: [PATCH 2/2] Update queue.cpp Updated as per your guidelines. --- CPP/algorithms/queue.cpp | 4 ++++ 1 file changed, 4 insertions(+) diff --git a/CPP/algorithms/queue.cpp b/CPP/algorithms/queue.cpp index 2da4c77..3b85ab4 100644 --- a/CPP/algorithms/queue.cpp +++ b/CPP/algorithms/queue.cpp @@ -3,9 +3,11 @@ #include #define size 100 + using namespace std; int arr[size],front=0,rear=0; + void enque(int value) { if(rear==size) @@ -15,6 +17,7 @@ void enque(int value) } arr[rear++]=value; } + int deque() { if(front>t;