Prerequisites – FIFO (First-In-First-Out) approach in Programming, FIFO vs LIFO approach in Programming
LIFO is an abbreviation for last in, first out. It is a method for handling data structures where the first element is processed last and the last element is processed first.
Real life example:
In this example, following things are to be considered:
- There is a bucket which holds balls.
- Different types of balls are entered in the bucket.
- The ball to enter the bucket last, will be taken out first.
- The ball entering the bucket next to last will be taken out after the ball above it (the newer one).
- In this way, the ball entering the bucket first will leave the bucket last.
- Therefore, the Last ball (Blue) to enter the bucket gets removed first and the First ball (Red) to enter the bucket gets removed last.
This is known as Last-In-First-Out approach or LIFO.
Where is LIFO used:
- Data Structures –
Certain data structures like Stacks and other variants of Stacks uses LIFO approach for processing data.
- Extracting latest information –
Sometimes computers use LIFO when data is extracted from an array or data buffer. When it is required to get the most recent information entered, the LIFO approach is used.
Program Examples for LIFO –
Using Stack data structure:
Pop: 4 3 2 1 0 Element on stack top : 4 Element is found at position 3 Element not found
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.
- FIFO vs LIFO approach in Programming
- Print the last k nodes of the linked list in reverse order | Recursive approach
- Count of strings that does not contain Arc intersection
- Count array elements having at least one smaller element on its left and right side
- Minimum number of operations required to return to the main folder
- Implementing Backward and Forward buttons of Browser
- Comparision between Tarjan's and Kosaraju's Algorithm
- Smallest string obtained by removing all occurrences of 01 and 11 from Binary String
- Count subarrays for every array element in which they are the minimum | Set 2
- Java Program to Reverse a String using Stack
- Maximum possible sum of squares of stack elements satisfying the given properties
- Implement Undo and Redo features of a Text Editor
- Print Stack Elements from Top to Bottom
- Maximize product of subarray sum with its minimum element
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.