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

Lines 760/1996

Browse Source
This commit is contained in:
Anri Lombard
2022-07-16 17:29:55 +02:00
parent ce3ba031d7
commit 38176c0138
1 changed files with 4 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

5
translations/README-af.md
View File

@ -753,4 +753,7 @@ of jy kan identifiseer wat die runtime kompleksiteit van verskeie algoritmes is.
- [ ] [blueprint](https://leetcode.com/discuss/general-discussion/786126/python-powerful-ultimate-binary-search-template-solved-many-problems)
- [ ] Implement:
- binary search (op 'n gesorteerde skikking van heelgetalle)
- binary search met recursion
- binary search met recursion
- ### Bitwise operations
- [ ] [Bits cheat sheet](https://github.com/jwasham/coding-interview-university/blob/main/extras/cheat%20sheets/bits-cheat-sheet.pdf) - you should know many of the powers of 2 from (2^1 to 2^16 and 2^32)