ergz/tlacyl
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

more algos

Browse Source
This commit is contained in:
Emanuel Rodriguez
2023-07-01 21:07:33 -07:00
parent 722aecd6dc
commit c5c2c3ecf4
5 changed files with 127 additions and 25 deletions
Download Patch File Download Diff File Expand all files Collapse all files

42
c/stack.c
View File

@@ -39,11 +39,12 @@ Stack* new_stack() {
return (s);
}
bool pop(Stack* s) {
int pop(Stack* s) {
if (s->length == 0) {
return false;
} else {
Node* n = s->head;
int val = n->value;
if (s->length == 1) {
s->head = NULL;
} else {
@@ -51,7 +52,7 @@ bool pop(Stack* s) {
}
free(n);
s->length--;
return true;
return val;
}
}
@@ -103,32 +104,23 @@ int main() {
printf("the value at the top of the stack is: %d\n", peek(s));
printf("the length of the stack is: %d\n", s->length);
// bool res = pop(s);
// printf("the value at the top of the stack is: %d\n", peek(s));
// printf("the length of the stack is: %d\n", s->length);
printf("the value at the top of the stack is: %d\n", pop(s));
printf("the length of the stack is: %d\n", s->length);
// res = pop(s);
// printf("the value at the top of the stack is: %d\n", peek(s));
// printf("the length of the stack is: %d\n", s->length);
printf("the value at the top of the stack is: %d\n", pop(s));
printf("the length of the stack is: %d\n", s->length);
// res = pop(s);
// printf("the value at the top of the stack is: %d\n", peek(s));
// printf("the length of the stack is: %d\n", s->length);
printf("the value at the top of the stack is: %d\n", pop(s));
printf("the length of the stack is: %d\n", s->length);
// res = pop(s);
// printf("the value at the top of the stack is: %d\n", peek(s));
// printf("the length of the stack is: %d\n", s->length);
// res = pop(s);
// printf("the value at the top of the stack is: %d\n", peek(s));
// printf("the length of the stack is: %d\n", s->length);
// res = pop(s);
// printf("the value at the top of the stack is: %d\n", peek(s));
// printf("the length of the stack is: %d\n", s->length);
// res = pop(s);
// printf("the value at the top of the stack is: %d\n", peek(s));
// printf("the length of the stack is: %d\n", s->length);
delete_stack(s);
printf("the value at the top of the stack is: %d\n", pop(s));
printf("the length of the stack is: %d\n", s->length);
printf("the value at the top of the stack is: %d\n", pop(s));
printf("the length of the stack is: %d\n", s->length);
printf("the value at the top of the stack is: %d\n", pop(s));
printf("the length of the stack is: %d\n", s->length);
printf("the value at the top of the stack is: %d\n", pop(s));
printf("the length of the stack is: %d\n", s->length);
return (0);
}