It requires no extra memory to keep the pointers in stack implementation utilizing an array. More efficient in terms of time, corresponded to stack implementation using linked-list.
The advantage of utilizing an array implementation for a stack is that it is more efficient in terms of time than a connected list implementation. This is because there is none of the work associated with claiming new budget as the size of the stack increases and waste collecting it as it reduces.
Push operation concerns following two steps. Increment the unstable Top so that it can now refer to the next memory location. Add element at the place of incremented top. This is directed to as adding new essence at the top of the stack.
To learn more about array, refer
https://brainly.com/question/28061186
#SPJ4
