This data structure is employed to solve the convex hull problem by the Graham's scan algorithm.
This data structure is employed to solve the convex hull problem by the Graham's scan algorithm. Used to implement depth-first search, it is built directly in hardware by processors of the MuP21 and the Harris RTX lines. Its array implementation doesn't require wrap-arounds, and its most natural implementation via linked lists requires only one extra pointer. Used in compilers and reverse Polish notation checkers, it is associated with methods like push and pop.  FTP name this data structure defined by the principle of last-in, first-out, a bit easier to build than a queue.
This data structure is employed to solve the convex hull problem by the Graham's scan algorithm.
{stack}