mirrors/TheAlgorithms-C
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C synced 2024-11-22 05:21:49 +03:00
Code Issues Packages Projects Releases Wiki Activity

Fix indenting

Browse Source
This commit is contained in:
dang hai 2019-07-02 16:02:55 -07:00
parent 5160b2f8ee
commit ab3173f581
2 changed files with 40 additions and 40 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

24
data_structures/stack/stack_linkedlist/main.c
View File

@ -5,18 +5,18 @@
int main() {
Stack_T stk;
stk = Stack_init();
Stack_push(stk, (int *) 1);
Stack_push(stk, (int *) 2);
Stack_push(stk, (int *) 3);
Stack_push(stk, (int *) 4);
stk = Stack_init();
Stack_push(stk, (int *) 1);
Stack_push(stk, (int *) 2);
Stack_push(stk, (int *) 3);
Stack_push(stk, (int *) 4);
printf("Size: %d\n", Stack_size(stk));
Stack_print(stk);
Stack_pop(stk);
printf("Stack after popping: \n");
Stack_print(stk);
Stack_pop(stk);
printf("Stack after popping: \n");
Stack_print(stk);
Stack_print(stk);
Stack_pop(stk);
printf("Stack after popping: \n");
Stack_print(stk);
Stack_pop(stk);
printf("Stack after popping: \n");
Stack_print(stk);
return 0;
}

56
data_structures/stack/stack_linkedlist/stack.c
View File

@ -8,60 +8,60 @@
typedef struct elem {
void *val;
struct elem *next;
struct elem *next;
} elem_t;
struct T {
int count;
elem_t *head;
elem_t *head;
};
/* Initial stack */
T Stack_init (void) {
T stack;
stack = (T) malloc(sizeof(T));
stack->count = 0;
stack->head = NULL;
return stack;
stack = (T) malloc(sizeof(T));
stack->count = 0;
stack->head = NULL;
return stack;
}
/* Check empty stack*/
int Stack_empty(T stack) {
assert(stack);
return stack->count == 0;
return stack->count == 0;
}
/* Return size of the stack */
int Stack_size(T stack) {
assert(stack);
return stack->count;
return stack->count;
}
/* Push an element into the stack */
void Stack_push(T stack, void *val) {
elem_t *t;
assert(stack);
t = (elem_t *) malloc(sizeof(elem_t));
t->val = val;
assert(stack);
t = (elem_t *) malloc(sizeof(elem_t));
t->val = val;
t->next = stack->head;
stack->head = t;
stack->count++;
stack->head = t;
stack->count++;
}
/* Pop an element out of the stack */
void *Stack_pop(T stack) {
void *val;
elem_t *t;
elem_t *t;
assert(stack);
assert(stack->count > 0);
t = stack->head;
stack->head = t->next;
assert(stack);
assert(stack->count > 0);
t = stack->head;
stack->head = t->next;
stack->count--;
val = t->val;
free(t);
return val;
val = t->val;
free(t);
return val;
}
/* Print all elements in the stack */
@ -69,11 +69,11 @@ void Stack_print(Stack_T stack) {
assert(stack);
int i, size = Stack_size(stack);
elem_t *current_elem = stack->head;
printf("Stack [Top --- Bottom]: ");
for(i = 0; i < size; ++i) {
printf("%p ", (int *)current_elem->val);
current_elem = current_elem->next;
}
printf("\n");
elem_t *current_elem = stack->head;
printf("Stack [Top --- Bottom]: ");
for(i = 0; i < size; ++i) {
printf("%p ", (int *)current_elem->val);
current_elem = current_elem->next;
}
printf("\n");
}