A stack is a last in, first out (LIFO) abstract data type and data structure. Perhaps the most common use of stacks is to store subroutine arguments and return addresses.

learn more… | top users | synonyms

3
votes
0answers
58 views

How can this simple coroutine implementation be improved?

This is a quick and dirty implementation of coroutines that implements yield by saving and restoring the stack to and from the heap. Here's an earlier version, which does the most naive possible ...
2
votes
3answers
191 views

Review implementation of stack by using pointers in C

After I had my code for stack implementation by array reviewed I wrote stack implementation by using pointers. Here's my code. Any suggestions for improvement are welcome. I'll be adding updated ...
2
votes
2answers
262 views

Review implementation of stack by using array in C

This question has become long after many updates. Click here to go down. I have implemented stack using arrays in C. Please give me suggestions on how to improve it. The purpose of writing it is ...
4
votes
3answers
162 views

Template Stack class review

I am trying to mimic std::stack in my implementation (just the basic interface - no iterators / allocators). Since I was having trouble handling all the memory allocation/deallocation, I read this. ...
0
votes
2answers
105 views

Using pointers for string manipulation in c

Here I'm taking a sentence a checking if it is a palindrome or not. I'm doing this in the process of learning stacks. Is there a way I can use pointers instead of char array 'sent' so that the number ...
3
votes
2answers
100 views

Another stack implementation (in C)

I just started learning C and the online book contained the exercise 'implement a stack'. So I did, but thought I'd put it here, because I still don't feel comfortable with pointers. So here it is: ...
1
vote
4answers
159 views

How could this postfix notation program be improved?

My postfix program allows the user two options one option for calculating a postfix equation: * Confirmations after each input (after an input, the user is ask for another number, operator, or final ...
6
votes
2answers
160 views

Valid Parentheses

Given a string containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid. The brackets must close in the correct order, "()" and "()[]{}" are ...
3
votes
4answers
103 views

How to Improve Stack Class C++ Implementation

This question is about improving my C++ coding skills. I was asked to implement a simple Static Integer Stack in C++ as an assignment. I've come up with the following code: class myStaticIntStack { ...
7
votes
2answers
280 views

Which is the most correct pattern for using Stack.Pop?

There at least 2 patterns of using Stack.Pop private Stack<T> availableResources; ... if (availableResources.Count > 0) { resource = availableResources.Pop(); ... } private ...
0
votes
2answers
198 views

Review C++ RPN Evaluator

So for Homework I had to write an RPN Evaluator and write the results to a text file. I've done all that - fine and dandy but it feels weird. Like the writing to my results text file. It doesn't feel ...
5
votes
3answers
570 views

A simple array-based Stack class in Java, what are my mistakes?

I have created a simple array-based Stack class with some methods like the actual Stack in Java. I am testing this for mistakes, but since I am learning Java and my tests may not be as comprehensive ...
0
votes
2answers
178 views

symmetric string checking [closed]

I wrote this routine in C to check the symmetry of a string using only a stack. (This is absolutely for educational purpose in our Theory Of Computation Class) Anyways, does this look right? For some ...
6
votes
3answers
220 views

implementation of a stack in C

Below is my implementation of a stack in C. Is it correct? And/or is there anything that I should fix to make it better in any way? stack.h #ifndef STACK_H #define STACK_H #define EMPTY_STACK -1 ...
2
votes
3answers
485 views

How to improve my stack implementation (uses array)?

Below is an implementation of a stack data structure using arrays. Please comment on the same. How can it be improved? Specific improvements I am looking for: Memory leaks C++ style Making code run ...
5
votes
2answers
392 views

Java and stacks: correct implementation?

I created this very simple stack concept's implementation. Could you tell me if it is correct and clean? Do you see any bad coding habits? public class MyStack { private static final int ...
1
vote
4answers
3k views

Is this good code? Linked List Stack Implementation

I have used the following code for a stack implementation. The top keeps track of the topmost node of the stack. Now since top is a data member of the node function, each node created will have a top ...
4
votes
1answer
517 views

Tree-traversal without recursion

I wrote the following code for printing all the paths to the leaf nodes in a tree (NOT a binary tree ) without using recursion. I have used a stack and performed dfs on the tree. Whenever I reach a ...
5
votes
3answers
957 views

Simple stack implementation, how can I improve the code?

I am not experienced in C++, and wrote the below code for implementing a stack data structure using a linked list. Can you please point out any flaws, errors, stupid mistakes, general improvements ...
9
votes
0answers
303 views

How can I make my stack monad faster?

I made a stack monad that lets one manipulate and control values on a stack. I want to know if it's correct, (it seems correct), how to make it faster, and how I could detect stack overflows without ...
3
votes
1answer
201 views

Concurrent stack implementations in Ruby (relative performance of mutexes/CAS?)

This code is very simple, but it is intended as an experiment in the relative performance of mutexes/CAS on different platforms. The latest version can always be found at: ...