Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Update and rename Circular Queue to Circular Queue.cpp #28

Open
wants to merge 2 commits into
base: master
Choose a base branch
from
Open

Update and rename Circular Queue to Circular Queue.cpp #28

Changes from 1 commit
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
63a4cd9
Update and rename Circular Queue to Circular Queue.cpp
Shubhamprakash007 Oct 24, 2021
1bbdeed
Update Circular Queue.cpp
Shubhamprakash007 Oct 24, 2021
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
20 changes: 10 additions & 10 deletions Circular Queue → Circular Queue.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,15 +2,15 @@

#Algorithm

Insertion of an element
//Insertion of an element

STEP 1 START
STEP 2 Store the element to insert in linear data structure
STEP 3 Check if (front == 0 && rear == MAX-1) || (front == rear+1) then queue Overflow else goto step 4
STEP 4 Check if (front == -1) then front = 0; rear= 0; else goto step 5
STEP 5 Check if (rear == MAX -1) then rear=0; else rear= rear+1; and goto step 6
STEP 6 Insert element cqueue_arr[rear] = item;
STEP 7 STOP
//STEP 1 START
//STEP 2 Store the element to insert in linear data structure
//STEP 3 Check if (front == 0 && rear == MAX-1) || (front == rear+1) then queue Overflow else goto step 4
//STEP 4 Check if (front == -1) then front = 0; rear= 0; else goto step 5
//STEP 5 Check if (rear == MAX -1) then rear=0; else rear= rear+1; and goto step 6
//STEP 6 Insert element cqueue_arr[rear] = item;
//STEP 7 STOP

##Program

Expand Down Expand Up @@ -110,7 +110,7 @@ int main()


##Output

/*
If you want to enter the element in queue press 1 else 0
1
Inset the element in queue : 5
Expand All @@ -124,6 +124,6 @@ If you want to enter the element in queue press 1 else 0
0
Queue is :
5 10 15

*/