GV

GeezerVison

The World Wide Web, restored to 800 pixels of glory.

Home|About|Gaming cabinet|Archives|How it works|Starter sites

On this site

  • Sign in
  • ActionsCI/CD and automation
  • CodespacesCloud development environments
  • All Features
  • Documentation
  • Training
  • Certifications
  • Build with Copilot
  • Customize Copilot
  • Integrations
  • Trending repos
  • GitHub Sponsors
  • Developer articles
  • Enterprises

This view

  • Original page
  • New address

GeezerVison is showing github.com — Data-Structure-Algorithm/StackUsingArray.cpp at main · aruncode49/Data-Structure-Algorithm

Expand file tree

/

StackUsingArray.cpp

Copy path
More file actions
More file actions

Latest commit

 

History

History
History
100 lines (89 loc) · 1.54 KB
/

StackUsingArray.cpp

Copy path

File metadata and controls

100 lines (89 loc) · 1.54 KB
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
#include<stdio.h>
#include<iostream>
using namespace std;
class Stack
{
private:
int capacity;
int top;
int *ptr;
public:
Stack();
Stack(int);
Stack(Stack &);
Stack& operator=(Stack &);
void push(int);
int peek();
void pop();
bool isFull();
bool isEmpty();
~Stack();
};
Stack::Stack()
{
capacity = 0;
top = -1;
ptr = NULL;
}
Stack::Stack(int cap)
{
capacity = cap;
top = -1;
ptr = new int[cap];
}
Stack::Stack(Stack &d)
{
capacity = d.capacity;
top = d.top;
ptr = new int[capacity];
for(int i = 0; i<=top; i++)
ptr[i] = d.ptr[i];
}
Stack& Stack::operator=(Stack& d)
{
if(ptr != NULL)
delete [] ptr;
capacity = d.capacity;
top = d.top;
ptr = new int[capacity];
for(int i = 0; i<=top; i++)
ptr[i] = d.ptr[i];
return *this;
}
void Stack::push(int data)
{
if(isFull())
cout<<"Stack Overflow! Data cannot push.";
else
{
top++;
ptr[top] = data;
}
}
int Stack::peek()
{
if(isEmpty())
cout<<"Stack Underflow.";
else
return ptr[top];
}
void Stack::pop()
{
if(isEmpty())
cout<<"Stack Underflow";
else
top--;
}
bool Stack::isFull()
{
return (top == capacity-1);
}
bool Stack::isEmpty()
{
return (top == -1);
}
Stack::~Stack()
{
if(ptr != NULL)
delete [] ptr;
}
You are visitor 01402520 — GeezerVison does not store the pages you look up.
Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required.