1
Some Git internals
Here is my test file tree. There are two files and a "src" subdirectory, where another two files are stored:
Dennis Yurichev
Short bio: CS/math geek, programmer, reverse engineer, author. Mostly known for the Reverse Engineering for Beginners , and the SAT/SMT by example books.
- Popular posts
- 6
- Total points
- 909
- HN comments
- 177
- Rank
- #2,449 personal
Visit yurichev.com → On Hacker News Aug 2015 – Aug 2021
Software Engineering 5Math & Algorithms 3Systems & Performance 1Security & Privacy 1Databases & Data 1AI & Machine Learning 1
2
3
4
5
Rolling hash; Rabin-Karp string search
This is yet another string search algorithm. (Previously my readers have read about Knuth-Morris-Pratt .)
6
Knuth-Morris-Pratt string-searching algorithm: DFA-less version
You see, there are two memory accesses per one character of the input string (at average). Hence, the total number of all memory accesses can be len*2 at worst.