Breaking News: Grepper is joining You.com. Read the official announcement!

stack algorithm in c++

Add Answer

Excited Emu answered on November 2, 2020 Popularity 1/10 Helpfulness 1/10

answer stack algorithm in c++

related stack implementation using class in c++

related stack c++

related c++ stack

related simplest code for stack implementation in c++

related stack in c++ data structure

related Basic stack implementation in c++

stack algorithm in c++

Comment

#include<iostream.h>
#include<conio.h>
#include<stdlib.h>
class stack

Popularity 1/10 Helpfulness 1/10 Language cpp

Source: Grepper

Tags: algorithm c++ stack

Link to this answer
Share Copy Link

Contributed on Apr 26 2021

Excited Emu

0 Answers Avg Quality 2/10

Closely Related Answers

stack implementation using class in c++

Comment

#include<iostream>
using namespace std;
#define Size 5

class Stack
{
private:
	int Array[Size];
	int top;
public:
	Stack()
	{
		top = -1;
	}
	void Push(int x)
	{
		if (top == Size - 1)
		{
			cout << "Error, stack overFlow!" << endl;
			return;
		}

		Array[++top] = x;
	}
	void Pop()
	{
		if (top == -1)
		{
			cout << "Error, stack is Empty!" << endl;
			return;
		}
		top--;
	}

	int Top()
	{
		return Array[top];
	}
	bool IsEmpty()
	{
		if (top == -1)
			return 1;
		return 0;
	}
	void print()
	{
		cout << "Stack: ";
		for (int i = 0; i <= top; i++)
		{
			cout << Array[i] << " ";
		}
		cout << "\n";
	}

};
int main()
{
	Stack s;
	s.Push(1);
	s.Push(2);
	s.print();

	return 0;
}

Popularity 10/10 Helpfulness 4/10 Language cpp

Source: codejudge.blogspot.com

Tags: c++

Link to this answer
Share Copy Link

Contributed on Dec 23 2021

coder

0 Answers Avg Quality 2/10

stack c++

Comments(1)

#include <bits/stdc++.h> 

stack<int> stk;
stk.push(5);
int ans = stk.top(5); // ans =5
stk.pop();//removes 5

Popularity 10/10 Helpfulness 3/10 Language cpp

Source: Grepper

Tags: c++

Link to this answer
Share Copy Link

Contributed on Nov 02 2020

Sparkling Seahorse

0 Answers Avg Quality 2/10

stack c++

Comment

/* Stack is a data structure that provides two O(1) time operations:
adding an element to the top and removing an element from the top.
It is only possible to access the top element of a stack. */
stack<int> s;
s.push(3);
s.push(2);
s.push(5);
cout << s.top(); // 5
s.pop();
cout << s.top(); // 2

Popularity 10/10 Helpfulness 3/10 Language cpp

Source: Grepper

Tags: c++

Link to this answer
Share Copy Link

Contributed on Apr 13 2021

BreadCode

0 Answers Avg Quality 2/10

c++ stack

Comment

#include <iostream>
#include <stack>
using namespace std;
int main() {
    stack<int> stack;
    stack.push(21);
    stack.push(22);
    stack.push(24);
    stack.push(25);
       
         stack.pop();
    stack.pop();
   
    while (!stack.empty()) {
        cout << stack.top() <<" ";
        stack.pop();
    }
}

Popularity 10/10 Helpfulness 2/10 Language cpp

Source: www.geeksforgeeks.org

Tags: c++

Link to this answer
Share Copy Link

Contributed on Sep 26 2022

Dead Dugong

0 Answers Avg Quality 2/10

simplest code for stack implementation in c++

Comment

void push(int val) {
   if(top>=n-1)
   cout<<"Stack Overflow"<<endl;
   else {
      top++;
      stack[top]=val;
   }
}

Popularity 8/10 Helpfulness 2/10 Language cpp

Source: www.tutorialspoint.com

Tags: c++ implementation implem

Link to this answer
Share Copy Link

Contributed on Nov 01 2021

Blue Baboon

0 Answers Avg Quality 2/10

simplest code for stack implementation in c++

Comment

void pop() {
   if(top<=-1)
   cout<<"Stack Underflow"<<endl;
   else {
      cout<<"The popped element is "<< stack[top] <<endl;
      top--;
   }
}

Popularity 8/10 Helpfulness 1/10 Language cpp

Source: www.tutorialspoint.com

Tags: c++ implementation

Link to this answer
Share Copy Link

Contributed on Nov 01 2021

Blue Baboon

0 Answers Avg Quality 2/10

simplest code for stack implementation in c++

Comment

void display() {
   if(top>=0) {
      cout<<"Stack elements are:";
      for(int i=top; i>=0; i--)
      cout<<stack[i]<<" ";
      cout<<endl;
   }else
   cout<<"Stack is empty";
}

Popularity 8/10 Helpfulness 1/10 Language cpp

Source: www.tutorialspoint.com

Tags: c++ implementation i

Link to this answer
Share Copy Link

Contributed on Nov 01 2021

Blue Baboon

0 Answers Avg Quality 2/10

stack in c++ data structure

Comment

10 pushed into stack
20 pushed into stack
30 pushed into stack
30 Popped from stack
Top element is : 20
Elements present in stack : 20 10

Popularity 10/10 Helpfulness 1/10 Language cpp

Source: www.geeksforgeeks.org

Tags: c++

Link to this answer
Share Copy Link

Contributed on Aug 24 2022

Disgusted Deer

0 Answers Avg Quality 2/10

Basic stack implementation in c++

Comment

-1

/* C++ program to implement basic stack
   operations */
#include <bits/stdc++.h>

using namespace std;

#define MAX 1000

class Stack {
    int top;

public:
    int a[MAX]; // Maximum size of Stack

    Stack() { top = -1; }
    bool push(int x);
    int pop();
    int peek();
    bool isEmpty();
};

bool Stack::push(int x)
{
    if (top >= (MAX - 1)) {
        cout << "Stack Overflow";
        return false;
    }
    else {
        a[++top] = x;
        cout << x << " pushed into stack\n";
        return true;
    }
}

int Stack::pop()
{
    if (top < 0) {
        cout << "Stack Underflow";
        return 0;
    }
    else {
        int x = a[top--];
        return x;
    }
}
int Stack::peek()
{
    if (top < 0) {
        cout << "Stack is Empty";
        return 0;
    }
    else {
        int x = a[top];
        return x;
    }
}

bool Stack::isEmpty()
{
    return (top < 0);
}

// Driver program to test above functions
int main()
{
    class Stack s;
    s.push(10);
    s.push(20);
    s.push(30);
    cout << s.pop() << " Popped from stack\n";
    //print all elements in stack :
    cout<<"Elements present in stack : ";
    while(!s.isEmpty())
    {
        // print top element in stack
        cout<<s.peek()<<" ";
        // remove top element in stack
        s.pop();
    }

    return 0;
}

Popularity 10/10 Helpfulness 1/10 Language cpp

Source: www.geeksforgeeks.org

Tags: basic basi

Link to this answer
Share Copy Link

Contributed on Jan 11 2022

Condemned Crocodile

0 Answers Avg Quality 2/10

stack algorithm in c++

Contents

More Related Answers

stack algorithm in c++

Closely Related Answers

stack implementation using class in c++

stack c++

stack c++

c++ stack

simplest code for stack implementation in c++

simplest code for stack implementation in c++

simplest code for stack implementation in c++

stack in c++ data structure

Basic stack implementation in c++

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.