-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmystack.c
144 lines (89 loc) · 1.56 KB
/
mystack.c
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
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
#include <stdio.h>
#include <stdlib.h>
#define LENGHT 10
int top=-1;
int array[LENGHT];
int isEmpty(){
if(top==-1){
return 1;
}
else{
return 0;
}
}
int isFull(){
if(top>=LENGHT-1){
return 1;
}
else{
return 0;
}
}
void push(int x){
if(isFull()){
printf("dizi dolu ");
}
else{
array[++top]=x;
}
}
void pop(){
if(isEmpty()){
printf("dizi bos eleman cikaramazsiniz!\n");
}
else{
top--;
}
}
void peak(){
if(isEmpty()){
printf("dizi bos eleman yok");
}
else{
printf("dizinin en tepe elamanı: %d\n",array[top]);
}
}
void PrintArray(){
if(isEmpty()){
printf("dizi bos eleman yok!\n");
}
else{
for(int i=0;i<=top;i++)
printf("%d,",array[i]);
}
}
int main(){
int secim;
int eleman;
while(1){
printf("*************STACK KULLANIMI***************\n");
printf("1 eleman ekleme\n");
printf("2 eleman cıkarma\n");
printf("3 tepe elemanı goster\n");
printf("4 diziyi goster\n");
printf("5 to exit\n");
printf("secimi yapınız!\n ");
scanf("%d",&secim);
switch(secim){
case 1:
printf("eklenecek elemanı giriniz:\n ");
scanf("%d",&eleman);
push(eleman);
break;
case 2:
peak();
pop();
break;
case 3:
peak();
break;
case 4:
PrintArray();
break;
case 5:
exit(0);
break;
}
}
return 0;
}