Git-Mirrors/master-algorithms-py
1
0
Fork 0
mirror of https://github.com/autistic-symposium/master-algorithms-py.git synced 2025-04-29 12:16:14 -04:00
Code Issues Packages Projects Releases Wiki Activity

Update README.md

Browse Source
This commit is contained in:
bt3gl 2023-08-08 17:47:37 -07:00 committed by GitHub
parent 2ef7451aba
commit 86b7f9ce18
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
stacks/README.md
View File

@ -5,7 +5,7 @@
* stacks are **last in, first out** (LIFO) abstract structures, where the newest element is first one to be removed from the structure. * stacks are **last in, first out** (LIFO) abstract structures, where the newest element is first one to be removed from the structure.
* a stack support `push` and `pop` at `O(1)`, and they be implmented with arrays or singly linked list. * a stack support `push` and `pop` at `O(1)`, and they be implemented with arrays or singly linked list.
* stacks are useful in **depth-first search** algorithms, where you can push temp data as you recurse, and remove them from the (memory or data structure) stack as you backtrace. * stacks are useful in **depth-first search** algorithms, where you can push temp data as you recurse, and remove them from the (memory or data structure) stack as you backtrace.