print · source · login   

Stack

Description

source: wikipedia [WP_STACK]:

In computer science, a stack or LIFO (last in, first out) is an abstract data type that serves as a collection of elements, with two principal operations:

  • push adds an element to the collection;
  • pop removes the last element that was added.

The term LIFO stems from the fact that, using these operations, the last element "popped off" a stack in series of pushes and pops is the first element that was pushed in the sequence.

Characteristics for Stack(n)

Benchmark NameInputs/OutputsRegistersConstantsStatesTransitionsSource
Queue(n)/stack(n)2/3n0n+12n+2[AHKOV12][FISBJ12][IHS14]