Hacker News new | past | comments | ask | show | jobs | submit login
Greater speed in memory-bound graph algorithms with just straight C code (lemire.me)
1 point by akshat_h on May 29, 2018 | hide | past | favorite | 1 comment



Interesting approach for optimization of an algorithm that I haven't seen in any books(as the author also mentions).

Is there any comprehensive resource for these, or does everyone kind of fiddle around and stumble on these independently. I have always been curious about 'hacks' such as the Fast inverse square root method. How does anyone figure these out in the first place?




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: