deaddabe
Joined 5 years ago
Joined 5 years ago
I had access to a local hackerspace during my studies that was 100% run by volonteers, without any university involvment. It was glorious. I sat next to software and hardware professional doing amazing projects on their free time.
I guess I still have to tinker on my own instead of sharing it with people eager to learn in a common space. I think that somehow big universities actually prevent such spaces from emerging by creating their own sterile initiatives.
This title is misleading. Original title: "Severe hypertension: Drinking too much coffee may double mortality risk".
Maybe the best solution would be to completly disable issues and PRs on Github. Still better than having to deal with stalebot. At least you know what to expect: external solicitation is not welcomed.
The list in TFA is so small that I wonder at what point creating a hashtable is more economical than going through a 9 items arrays. In C, accounting for allocations, etc. I would not be surprised that strcmp on an static array would be faster.
As always, measure with benchmarks (which does the article, but not on array vs. hashtable). In theory, O(1) is better than O(N). In pratice, with memory allocations and all, the order of magnitude of N plays a role.
Anyways, I would have used a hashtable also to convey the idea that I only want to check if the item is in the list. Python makes this easy. In C, I would have used an array unless N is "large enough".