Stack.

RPNCalc: The Command Line Reverse Polish Notation (RPN) Calculator

Provides base class (TSequentialVector) that can be used to implement both FIFO (queue) and LIFO (stack) vectors with items/entries of specific type.

Monty Project | Month 3 | Sprint 2: This project is an interpreter for Monty ByteCodes files, written in C. It implements the concepts of a stack (LIFO - Last In, First Out) and a queue (FIFO - First In, First Out). The interpreter supports various commands such as push, pall, pint, pop, swap, add, nop, sub, div, mul, and more.

stackage implements flexible stack and condition types with useful features

An implementation of stacks in TypeScript for nodejs and browser

Stack is an Abstrack Data Type (Linear) Data Structure that defines sets operations and behaviour for certain purpose, it follows LIFO principle

Extensible cache templates.

Queue handling library (designed on Arduino)

Queue handling library (written in plain c)

Simple and lightweight FIFO\LIFO buffer library for the Arduino.

Palindrome, Bubble sort / Selection sort and Stack Data structure apps (LIFO and FIFO)

Files containing Monty byte codes usually have the .m extension. Most of the industry uses this standard but it is not required by the specification of the language. This repository contains the codebase which contains an interpreter for Monty ByteCode files.

Examples of Data Structures and Algorithms in C Sharp

A caching library for Python

Manage and orchestrate the orderly shutdown of resources with support for FIFO, LIFO, and grouped closing in Go.

Explore the Monty Interpreter! This project focuses on building an interpreter for Monty ByteCode files, providing hands-on experience with stacks and queues.

Development of systems for handling data in files, strings and dynamic and non-homogeneous structures FIFO, LIFO, Bubble Sort and Merge-Sort.

📀 A python project to train the development of some data structures (linked lists, FIFO and LIFO).

In data structures and computer science, a "stack" is an abstract data type that follows the Last-In-First-Out (LIFO) principle. It is a linear data structure that behaves like a physical stack or pile of items, such as a stack of plates.