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 — Algorithm/queue_using_stack/stack/pop.c at master · osemrt/Algorithm

Expand file tree

/

pop.c

Copy path
More file actions
More file actions

Latest commit

 

History

History
History
19 lines (15 loc) · 367 Bytes
/

pop.c

Copy path

File metadata and controls

19 lines (15 loc) · 367 Bytes
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
#include "../declarations.h"
/**
* Decreases the stack top pointer by one
* @param STACK* stack holds the address of the stack
* @return INT_MIN to show the error while trying to pop the element, otherwise the popped value.
*/
int pop(STACK* stack) {
if (!isEmpty(stack)) {
--stack->top;
return stack->items[stack->top + 1];
}
else {
return INT_MIN;
}
}
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.