Algorithm For Stack With Random Operations (Stack Using Random Array Operations)
A stack is an ordered collection of items for which we can only add or remove items from one end (the top of the stack). The stack is another container class, much like a list, but with a much more limited set of operations: push, pop and size .
The proposed work presents a fundamental algorithm to perform add,delete and size operations on random locations in stack .Array based implementation of this algorithm can perform operation at any random location in stack (not limited with top only).The total algorithm works on two basic set of arrays in which one works as stack (for storing elements) and other works as confirmation table for stack (for storing and matching locations).
Keywords
Abstract Views: 163
PDF Views: 0