Create array-stack.c

Author: sagsango

LinkedList/array-stack.c

@@ -0,0 +1,70 @@
+#include <stdio.h>
+#include <stdlib.h>
+
+#define MAX 100 // Maximum size of the stack
+
+typedef struct Stack {
+    int items[MAX];
+    int top;
+} Stack;
+
+// Initialize the stack
+void initStack(Stack *s) {
+    s->top = -1;
+}
+
+// Check if the stack is empty
+int isEmpty(Stack *s) {
+    return s->top == -1;
+}
+
+// Check if the stack is full
+int isFull(Stack *s) {
+    return s->top == MAX - 1;
+}
+
+// Push an element onto the stack
+void push(Stack *s, int value) {
+    if (isFull(s)) {
+        printf("Stack Overflow!\n");
+        return;
+    }
+    s->items[++(s->top)] = value;
+}
+
+// Pop an element from the stack
+int pop(Stack *s) {
+    if (isEmpty(s)) {
+        printf("Stack Underflow!\n");
+        return -1;
+    }
+    return s->items[(s->top)--];
+}
+
+// Peek the top element
+int peek(Stack *s) {
+    if (isEmpty(s)) {
+        printf("Stack is empty!\n");
+        return -1;
+    }
+    return s->items[s->top];
+}
+
+int main() {
+    Stack stack;
+    initStack(&stack);
+
+    push(&stack, 10);
+    push(&stack, 20);
+    push(&stack, 30);
+
+    printf("Top element: %d\n", peek(&stack));
+
+    printf("Popped: %d\n", pop(&stack));
+    printf("Popped: %d\n", pop(&stack));
+
+    if (isEmpty(&stack))
+        printf("Stack is empty now.\n");
+
+    return 0;
+}