TE
科技回声
首页24小时热榜最新最佳问答展示工作
GitHubTwitter
首页

科技回声

基于 Next.js 构建的科技新闻平台,提供全球科技新闻和讨论内容。

GitHubTwitter

首页

首页最新最佳问答展示工作

资源链接

HackerNews API原版 HackerNewsNext.js

© 2025 科技回声. 版权所有。

Greater speed in memory-bound graph algorithms with just straight C code

1 点作者 akshat_h将近 7 年前

1 comment

akshat_h将近 7 年前
Interesting approach for optimization of an algorithm that I haven&#x27;t seen in any books(as the author also mentions).<p>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 &#x27;hacks&#x27; such as the Fast inverse square root method. How does anyone figure these out in the first place?