Description du poste
In a further bid to #GetFediHired, I'm going to post some of the work I have done. I'll post something every day!
Today, it's a blog post talking about different string matching implementations in Haskell, how we can assess their performance, and a reasonably clear explanation of the BNDM algorithm and the source of its speed. It's on my soon-to-be-former employer's blog: https://www.mlabs.city/blog/first-know-thy-self-understanding-string-matching-performance-with-ascii
(my name is at the _very_ bottom, in small font)
#Haskell #Algorithms