This is extremely good, but I wish you used very low level code to show how to code these in all languages (aka c). Or showed a code version of a Queue. However I don't think Queues are necessarily "Slower" but they have different uses and purposes obviously. if you need LIFO, you pretty much need to use a stack, if you have FIFO you need to use a queue. That's the big different at least in my view.
However I won't disagree with any of your points, they're all good, I just believe a more indepth design of how to write a (static size) queue or stack might be clear so people understand what's happening.
This is extremely good, but I wish you used very low level code to show how to code these in all languages (aka c). Or showed a code version of a Queue. However I don't think Queues are necessarily "Slower" but they have different uses and purposes obviously. if you need LIFO, you pretty much need to use a stack, if you have FIFO you need to use a queue. That's the big different at least in my view.
However I won't disagree with any of your points, they're all good, I just believe a more indepth design of how to write a (static size) queue or stack might be clear so people understand what's happening.
Thanks for the article.