From a6b666c63015b89b58ac8d26c545fcbe30fdf912 Mon Sep 17 00:00:00 2001 From: Anri Lombard Date: Sat, 16 Jul 2022 17:27:32 +0200 Subject: [PATCH] Lines 740/1996 --- translations/README-af.md | 11 ++++++++++- 1 file changed, 10 insertions(+), 1 deletion(-) diff --git a/translations/README-af.md b/translations/README-af.md index e2527cd..ea93d49 100644 --- a/translations/README-af.md +++ b/translations/README-af.md @@ -714,6 +714,7 @@ of jy kan identifiseer wat die runtime kompleksiteit van verskeie algoritmes is. - full() - [ ] Cost: - 'n Slegte implementering met linked list waar jy enqueue by die hoof en dequeue by die stert sal wees O(n) + want you sal die alement langs die laaste nodig hê, wat 'n volle transversal elke dequeue veroorsaak - enqueue: O(1) (amortized, linked list en array [probing]) - dequeue: O(1) (linked list en array) - empty: O(1) (linked list en array) @@ -734,4 +735,12 @@ of jy kan identifiseer wat die runtime kompleksiteit van verskeie algoritmes is. - [ ] [Phone Book Problem (video)](https://www.coursera.org/lecture/data-structures/phone-book-problem-NYZZP) - [ ] distributed hash tables: - [Instant Uploads And Storage Optimization In Dropbox (video)](https://www.coursera.org/lecture/data-structures/instant-uploads-and-storage-optimization-in-dropbox-DvaIb) - - [Distributed Hash Tables (video)](https://www.coursera.org/lecture/data-structures/distributed-hash-tables-tvH8H) \ No newline at end of file + - [Distributed Hash Tables (video)](https://www.coursera.org/lecture/data-structures/distributed-hash-tables-tvH8H) + + - [ ] Implement met 'n skikking en gebruik linear probing + - hash(k, m) - m is grootte van hash table + - add(sleutel, waarde) - as sleutel al klaar beskikbaar is, opdateer waarde + - exists(sleutel) + - get(sleutel) + - remove(sleutel) +