algorithm/coding-interview-university
1
0
Fork 0
mirror of https://github.com/jwasham/coding-interview-university.git synced 2025-07-10 16:31:29 +08:00
Code Issues Packages Projects Releases Wiki Activity

Lines 710/1996

Browse Source
This commit is contained in:
Anri Lombard
2022-07-16 17:17:58 +02:00
parent c320804004
commit 9ebb125666
1 changed files with 7 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
translations/README-af.md
View File

@ -702,4 +702,10 @@ of jy kan identifiseer wat die runtime kompleksiteit van verskeie algoritmes is.
- ### Queue
- [ ] [Queue (video)](https://www.coursera.org/lecture/data-structures/queues-EShpq)
- [ ] [Circular buffer/FIFO](https://en.wikipedia.org/wiki/Circular_buffer)
- [ ] [Circular buffer/FIFO](https://en.wikipedia.org/wiki/Circular_buffer)
- [ ] Implementeer met linked-list, met stert wyser:
- enqueue(waarde) - voeg waarde by posisie by stert
- dequeue() - lewer waarde en verwyder die minste onlangse gevoegde element (voorkant)
- empty()
- [ ] Implementeer met vaste-grootte skikking:
-