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 — cpp/algorithms/dynamic.cpp at master · AllAlgorithms/cpp

This repository was archived by the owner on Sep 7, 2025. It is now read-only.

Expand file tree

/

dynamic.cpp

Copy path
More file actions
More file actions

Latest commit

 

History

History
History
79 lines (71 loc) · 1.61 KB
/

dynamic.cpp

Copy path

File metadata and controls

79 lines (71 loc) · 1.61 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
//Stack is a data structure based on a last in first out (LIFO) method
//This code defines and implements stack's functions using linked list
#include<stdio.h>
#include<stdlib.h>
void pop();
void push();
void display();
struct node{
int value;
struct node *link;
}*top=NULL;
void main(){
int choice;
do{
printf("*****Menu*****");
printf("\n1.Push\n2.Pop\n3.Display\n4.Exit");
printf("\nEnter you choice number::\t");
scanf("%d",&choice");
switch(choice){
case 1: push();
break;
case 2: pop();
break;
case 3: display();
break;
case 4: exit(0);
default:printf("\nWrong choice, Try entering again");
}
}while(1);
getch();
}
void push(){
int n;
ptr=(struct node *)malloc(sizeof(struct node));
if (!ptr)
{
printf("\nMemory Overflow");
return;
}
printf("\nEnter the number to be pushed");
scanf("%d",n);
ptr->value=n;
top->link=ptr;
top=ptr;
printf("\nElement pushed Successfully");
}
void pop(){
struct node *ptr=top;
if(!top)
{
printf("\nMemory Underflow");
return;
}
top=top->link;
free(ptr);
printf("\nElement popped succefully");
}
void display(){
struct node *ptr=top;
printf("\n");
if(!top)
{
printf("The stack is Empty");
return;
}
while(!ptr)
{
printf("\t%d",ptr->value");
ptr=ptr->link;
}
}
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.