You need to know Algorithms and Data Structures in Front-end anyway
summary
Practical front-end use of algorithms and data structures: the talk demonstrates that replacing naive nested loops with a single-pass lookup map can give ~100× speedups on large lists, and replacing chained filter/map with a single accumulator reduces allocations and cuts memory by ~30% (10–200% depending on device). It shows concrete algorithmic choices—binary search and O(n log n) sorts instead of quadratic methods—and simple graph/tree models in a TV app to lower latency and memory on constrained hardware.
AI-written summary · about
chapters (8)
- 0:00Introduction
- 3:50Algorithm complexity
- 12:34Front-end data structures
- 20:40Real code optimizations
- 27:20Graphs and trees
- 33:20Sorting algorithms
- 39:18Why algorithms matter
- 40:25Q&A
related talks
39mData structures for frontend developers
40mUsing Data-Oriented Design to Build Apps Better
39mAlgorithms in the Front End: from V8 to VDOM
56mFrontend Performance Optimization
21mAlgorithms and Their Habitat
38mThe Front End Architecture Revolution
28mFantastic Frontend Performance Tricks & Why We Do Them
34mNew Adventures in Front-End, 2021 Edition