
EggCup Web Design Ltd.
5.3K posts

EggCup Web Design Ltd.
@EggCupWebDesign
We eat problems for breakfast! Struggling with a slow site? Concerned about conversions? We'll boost your competitive edge like a hot mug of builder’s tea!









How do you fit a 250kB dictionary in 64kB of RAM and do lookups? For reference, even gzip -9 cannot compress this file beyond 85kB. In the 1970s, Douglas McIlroy at AT&T had the same challenge when implementing the spell checker for Unix. Instead of relying on generic compression techniques, he analyzed the distribution of the data and came up with a compression algorithm which was just 0.03 bits away from the theoretical limit of possible compression. To this day, it remains unbeaten. The story of how he designed this dictionary lookup from the ground up is a lesson in software engineering. How you consider the resource constraints in front of you and design your solution to run within them. In my latest article I take you through each step of the design of this ingenious algorithm right from the scratch. (Check replies for the link)






















