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:45:16 -07:00 committed by GitHub
parent 39a321a8e0
commit 802c4c9d5a
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
queues/README.md
View File

@ -2,7 +2,7 @@
<br>
* queues are **first in, first out (FIFO) abstract structures** (*i.e.*, items are removed at the same order they are added) that can be implemented with two arrays or a dynamic array (linked list), as long as items are added and removed from opposite sides.
* queues are **first in, first out (FIFO) abstract structures** (*i.e.*, items are removed in the same order they are added) that can be implemented with two arrays or a dynamic array (linked list), as long as items are added and removed from opposite sides.
* queues support **enqueue** (add to one end) and **dequeue** (remove from the other end, or tail).
@ -34,7 +34,7 @@
* to build a ring with a fixed size array, any of the elements could be considered as the head.
* to enqueue, you loop the queue with the tail index until find a `None` (even if it has to loop back):
* to enqueue, you loop the queue with the tail index until you find a `None` (even if it has to loop back):
<br>
@ -137,7 +137,7 @@ class CircularQueue:
<br>
* another version used only one index (for `head`) and calculates the tail with the equation:
* another version used only one index (for `head`) and calculate the tail with the equation:
<br>