What is the difference between stack and array?

Answer 1

Briefly, there are two main differences between an array and a stack. Firstly, an array can be multi-dimensional, while a stack is strictly one-dimensional. Secondly, an array allows direct access to any of its elements, whereas with a stack, only the 'top' element is directly accessible; to access other elements of a stack, you must go through them in order, until you get to the one you want. I hope this answered your question.

OK?

Answer 2

An array is a contiguous block of memory.

A stack is a first-in-last-out data structure with access only to the top of the data.

Note that as the definition of a stack does not include how the actual data is stored, it can be backed by various other data structures, including arrays.

Note: C doesn't have built-in stack type.

Answer 3

stack is derived from linear lists which intern as ordered collection of elements. it has a special feature that insertion and deletion can be done at only one end called Top of the Stack(TOP). It operated on first in first out method(FIFO).

Queue are also data structures just like stacks but has FIRST IN FIRST OUT fashion of operation.

Answer 4

An array is a contiguously allocated container that permits random access but does not allow efficient growth unless additional space as reserved in which to grow. Thus insertions and extractions typically occur at the end of the array.

A queue is a container where elements are inserted at the end of the container and extracted from the beginning. Queues can be implemented in a variety of ways, including circular arrays and singly-linked lists but are generally more efficient when implemented as a modified deque (pronounced "deck"). A deque is similar to an array but allows efficient insertions and extractions at both ends of the sequence.