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 720/1996

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

11
translations/README-af.md
View File

@ -708,4 +708,13 @@ of jy kan identifiseer wat die runtime kompleksiteit van verskeie algoritmes is.
- dequeue() - lewer waarde en verwyder die minste onlangse gevoegde element (voorkant)
- empty()
- [ ] Implementeer met vaste-grootte skikking:
-
- enqueue(value) - voeg item aan einde van beskikbare
- dequeue() - lewer waarde en verwyder minste onlangse gevoegde element
- empty()
- full()
- [ ] Cost:
- 'n Slegte implementering met linked list waar jy enqueue by die hoof en dequeue by die stert sal wees O(n)
- enqueue: O(1) (amortized, linked list en array [probing])
- dequeue: O(1) (linked list en array)
- empty: O(1) (linked list en array)