Pastable version of Stack Implementation

<div style="overflow:auto;border:solid 1px #ccc;background:#000;color:#F8F8F8">
 <div class="section">
 
 <pre style="float:left;margin:0 10px;border-right:0;color:#666;">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
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115</pre>
 <pre class="sunburst">/*
 * Stack.c
 *
 * Program to demonstrate the stack concept
 *
 * by Ahmed M. Sha'alan, disturbed.619@gmail.com, www.thedb.com/m
 */
 
#include &lt;stdio.h&gt;
#include &lt;stdlib.h&gt;				//for the system() and exit() functions

#define STACKSIZE 100				//the stack size

struct STACK {					//stack structure
	short int top;
	int items[STACKSIZE];
};

typedef struct STACK stk;			//a short-hand for the stack

int empty(stk *ptr){				//checks if the stack is empty
	return(ptr-&gt;top&lt;0?1:0);			//shorter and makes more sense than the IF statment
}

int full(stk *ptr) {				//checks if the stack is full
	return(ptr-&gt;top&gt;=STACKSIZE?1:0);	//read above
}

void push(stk *ptr, int *x) {			//pushs a value to the top of the stack
		ptr-&gt;items[++ptr-&gt;top]=*x;
}

int pop(stk *ptr) {		//displays the top value of the stack
		return (ptr-&gt;items[ptr-&gt;top--]);
}

void print_pop(stk *ptr){	//the pop() function but with empty() check and messages
	if(empty(ptr))	
		puts(&quot;&gt;&gt;The stack is empty!&quot;);		
	else
		printf(&quot;&gt;&gt;The last value in the stack is: %d.\n&quot;, pop(ptr));
}

void print_push(stk *ptr){	//the push() function with the checking and messages
	int x;
	if(full(ptr))
		puts(&quot;&gt;&gt;The stack is full!&quot;);
	else{
		printf(&quot;&gt;&gt;Enter the value you want to push: &quot;);
		fflush(stdin);
/*to clear the standard input and prevent a weird behavior,
although i been told it's not THE way 2 do it*/
		scanf(&quot;%d&quot;, &amp;x);								
		push(ptr, &amp;x);
		puts(&quot;&gt;&gt;done!&quot;);
	}
}

void print_all(stk *ptr) {			//prints all the elements in the stack
	unsigned short int i=0;
	system(&quot;cls&quot;);
	puts(&quot;********************&quot;);
	if (empty(ptr))
		puts(&quot;&gt;&gt;The stack is empty!&quot;);
	else{
		for (;i&lt;=ptr-&gt;top;i++)
		printf(&quot;|%d- %d\n&quot;,i+1, ptr-&gt;items[i]);
	}
	puts(&quot;********************&quot;);
}

void interface(stk *ptr) {	//the &quot;interface&quot; lol, i KNOW it's a console aplication :D
	unsigned short int choice;		//we only need numbers from 1 to 4
	system(&quot;cls&quot;);
	puts(&quot;\n=====================================&quot;);
	puts(&quot;Stack Implementation in C...&quot;);
	puts(&quot;=====================================&quot;);
BEGINING:
	puts(&quot;\n=======================================================&quot;);
	puts(&quot;1- Press 1 for putting a value in the stack.&quot;);
	puts(&quot;2- Press 2 for displaying the last value in the stack.&quot;);
	puts(&quot;3- Press 3 for displaying ALL the values in the stack.&quot;);
	puts(&quot;4- Press 4 for exiting the program.&quot;);
	puts(&quot;=======================================================&quot;);
	printf(&quot;What do you want to do? &quot;);
	fflush(stdin);		//read above
	scanf(&quot;%d&quot;, &amp;choice);
	puts(&quot;&quot;);		//new line
	switch (choice) {
		case 1:
			print_push(ptr);
			break;
		case 2:
			print_pop(ptr);	
			break;
		case 3:
			print_all(ptr);
			break;
		case 4:
			exit(1);
		default:
			puts(&quot;&gt;&gt;Please make sure you've entered a valid option..&quot;);
			break;		
	}
	goto BEGINING;	//repeat again and again til the user exits
}

int main() {				//finaly the main :D
	stk stack;
	stack.top=-1;			//sets the top to -1 for the stack to act right
	interface(&amp;stack);
	return 0;
}

</pre>
 </div>
 </div>

Refactor :my => 'code'

Recent

Popular

Pastable version of Stack Implementation