How can I implement a stack in C?
To implement a stack in C, you can use an array or a linked list. Which one would you prefer?
Let's go with the array implementation.
Great choice! You can define a stack using an array and a top variable to track the top element. Would you like to see the code?
Yes, please show me the code for the array implementation.
Here's a simple implementation:
#define MAX 100
struct Stack {
int arr[MAX];
int top;
};
void initStack(struct Stack* s) {
s->top = -1;
}
int isFull(struct Stack* s) {
return s->top == MAX - 1;
}
int isEmpty(struct Stack* s) {
return s->top == -1;
}
void push(struct Stack* s, int value) {
if (!isFull(s)) {
s->arr[++s->top] = value;
}
}
int pop(struct Stack* s) {
if (!isEmpty(s)) {
return s->arr[s->top--];
}
return -1; // or some error value
}
Would you like to know more about how to use this stack?
Get this answer and more from ChatGPT in Telegram, try it for free!
Get Started For FreePowered by advanced language models trained on billions of online words and conversations, MagicBuddy delivers friendly and helpful chat on demand.
Ask questions and get answers. Crack jokes and get laughs. Or even get writing ideas and study help. MagicBuddy's conversational intelligence allows for a truly unique and useful chat experience.
Curious? Try these prompts:
MagicBuddy is incredibly easy to use and the responses are lightning fast! 🥇
Impressive! MagicBuddy is my go-to AI assistant. It’s quick, accurate, and user-friendly.
Sending voice messages makes it easier to use in the middle of the day and the answers are super fast.
Love it! A friend of mine told me about it and it has made my life so much easier. It’s like having a helpful friend in my pocket!
I use 2 months already, simply amazing! MagicBuddy delivers answers in a snap. It’s a must-have tool for staying informed!
Game-changer! MagicBuddy’s speed and accuracy are unmatched. It’s my secret weapon for productivity
Say Hello to Your New Telegram BFF - Try MagicBuddy Free!
Get Started For Free