Skip to content

Update comments to stack operations #16

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

Open
suhitmajumdar wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Update comments to stack operations #16

Changes from all commits
Commits
Show all changes
1 commit
Select commit
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
17 changes: 8 additions & 9 deletions stack_using_array.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,43 +2,42 @@
using namespace std;

int stack[100001];
int top=0;
int top=0;//Top is a variable which indicates the index of the stack at a particular instant

void push(int x)
{
if(top==100001)
if(top==100001)//Conditon to check if the stack is full
{
cout<<"\nOverflow";
}
else
{
stack[top++]=x;
stack[top++]=x;//Inserts the element in the stack
}
}

void pop()
{
if (top==0)
void popempty
if (top==0)//Conditon to check if the stack is empty
{
cout<<"\nUnderflow";
}
else
{
cout<<"\n"<<stack[--top]<<" deleted";
cout<<"\n"<<stack[--top]<<" deleted";//Deletion operation performed
}
}

void show()
{
for (int i = 0; i < top; i++)
{
cout<<stack[i]<<"\n";
cout<<stack[i]<<"\n";//Displays the contents of the stack
}
}

void topmost()
{
cout << "\nTopmost element: "<<stack[top-1];
cout << "\nTopmost element: "<<stack[top-1];//Prints the topmost element
}
int main()
{
Expand Down