'Fastware' - Andrei Alexandrescu [ ACCU 2016 ]
ACCU Conference1 HN recommender · recommended in 1 month, 2016–2021
talk · advanced · evergreen · 2016–2021 on HN
Andrei Alexandrescu's ACCU 2016 talk previews material from his book on writing fast code, with a focus on optimization techniques such as sentinels and faster search.
HN recommends it as a careful, entertaining talk on low-level optimization that shows how textbook algorithms can be sped up.
Up next
6 mo on HNSecret History of Silicon Valley
Computer History Museum
6 HN recommender · 2010–2026
4 mo on HNTwenty Minutes of Reasons to Use the RemedyBG Debugger
Molly Rocket
4 HN recommender · 2022–2024
7 mo on HN[EPILEPSY WARNING] How fast should an unoptimized terminal run?
Molly Rocket
6 HN recommender · 2021–2026
4 mo on HNAnders Hejlsberg and Lars Bak: TypeScript, JavaScript, and Dart
DartlangTV
4 HN recommender · 2014–2024
10 mo on HNRefterm Lecture Part 1 - Philosophies of Optimization
Molly Rocket
10 HN recommender · 2021–2026
16 mo on HNHow Python was Shaped by leaky Internals, Armin Ronacher, Flask framework
Видео с мероприятий {speach!
15 HN recommender · 2017–2025
11 mo on HNCppCon 2015: Andrei Alexandrescu “std::allocator...”
CppCon
7 HN recommender · 2017–2025
12 mo on HNPreventing the Collapse of Civilization / Jonathan Blow (Thekla, Inc)
DevGAMM
14 HN recommender · 2020–2025
10 mo on HN"Performance Matters" by Emery Berger
Strange Loop Conference
12 HN recommender · 2019–2025
11 mo on HNThe Thirty Million Line Problem
Molly Rocket
11 HN recommender · 2018–2024
10 mo on HNCppCon 2017: Matt Kulukundis “Designing a Fast, Efficient, Cache-friendly Hash Table, Step by Step”
CppCon
9 HN recommender · 2018–2026
10 mo on HNErlang Factory 2014 - That's 'Billion' with a 'B': Scaling to the Next Level at WhatsApp
Erlang Solutions
6 HN recommender · 2014–2022
3 comments from Hacker News
See Alexandrescu’s Fastware talk on how amazingly sentinels can improve even textbook algorithms, and how to apply the approach intelligently. E.g., for a linear search, overwrite the last element with the sought after value, and do a tiny bit of work to make that safe and to undo it before return. If you’re skeptical, I really do encourage you to watch, he’s not sloppy. ▶ this video
Assuming you're talking about Concepts, I've heard Andrei Alexandrescu, for example, challenge that hope [0], but I'd be happy to hear this has been fixed. [0] ▶ this video
Andrei Alexandrescu describe the usage of this kind of search to speed up quicksort in his 'Fastware' (fun) video: ▶ this video Discussed here: link