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

Update README.md

Browse Source
This commit is contained in:
marina 2023-08-07 17:56:19 -07:00 committed by GitHub
parent 66a2a3ad3a
commit a8e6ec8884
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

@ -9,7 +9,7 @@
* 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.
* to keep `find_min()` at `O(1)`, you can keep track of the minimum when pushing and poping:
* to keep `find_min()` at `O(1)`, you can keep track of "prior minimum" when pushing and poping:
<br>