From eef8d697e0af183234e11d35c5ef3cc215d2091a Mon Sep 17 00:00:00 2001 From: Anri Lombard Date: Fri, 15 Jul 2022 21:23:17 +0200 Subject: [PATCH] Lines 630/1996 --- translations/README-af.md | 7 ++++++- 1 file changed, 6 insertions(+), 1 deletion(-) diff --git a/translations/README-af.md b/translations/README-af.md index 7cf54f7..7aaed82 100644 --- a/translations/README-af.md +++ b/translations/README-af.md @@ -621,4 +621,9 @@ Maar moet nie vergeet om kode probleme op te los terwyl jy leer nie! - [ ] TopCoder (includes recurrence relations and master theorem): - [Computational Complexity: Section 1](https://www.topcoder.com/thrive/articles/Computational%20Complexity%20part%20one) - [Computational Complexity: Section 2](https://www.topcoder.com/thrive/articles/Computational%20Complexity%20part%20two) -- [ ] [Cheat sheet](http://bigocheatsheet.com/) \ No newline at end of file +- [ ] [Cheat sheet](http://bigocheatsheet.com/) + +Well, dis genoeg van daardie. + +Wanneer jy deur "Cracking the Coding Interview" gaan, is daar 'n hoofstuk oor hierdie, en by die einde is daar 'n quiz om te sien +of jy kan identifiseer wat die runtime kompleksiteit van verskeie algoritmes is. Dis 'n super revisie en toets.