Someone improved my code by 40,832,277,770%
推荐理由
Quick google yields very good examples in huge improvements on a single algorithm level
说明
这是2022年由Stand-up Maths发布的一部讲解,主题归在Software performance & optimization。它讲的是code optimization这一支里的具体问题,而不是把整个领域扫一遍。适合已经能看懂基本术语、想继续往下走的人。内容上可以概括成:Matt Parker follows the community effort to speed up his slow Wordle-solving code, which ended up running hundreds of millions of times faster. He walks through the techniques contributors used.这些读者给出的理由,核心是:Cited as a fun example of how algorithmic changes can yield enormous performance gains.讲法不绑某一条新闻,过几年仍然可以当材料看。从2022年到2023年,有1位不同的读者在1个不同月份把它推荐出来,其中明确叫别人去看的有0次。适合用一集把一个概念补上的人。抓住它用的那个图像或类比,比背公式重要。如果已经会了基本定义,就把注意力放在它怎么把code optimization变成能跟着复述的例子。
视频信息
- 频道
- Stand-up Maths
- 时长
- 28 分 47 秒
- 发布年份
- 2022
同主题更多
- How Python was Shaped by leaky Internals, Armin Ronacher, Flask framework
- CppCon 2015: Andrei Alexandrescu “std::allocator...”
- Preventing the Collapse of Civilization / Jonathan Blow (Thekla, Inc)
- "Performance Matters" by Emery Berger
- The Thirty Million Line Problem
- CppCon 2017: Matt Kulukundis “Designing a Fast, Efficient, Cache-friendly Hash Table, Step by Step”