You need to know Algorithms and Data Structures in Front-end, anyway
summary
Concrete examples show how small algorithm and data-structure changes in front-end code produce large wins: replacing nested loops with a lookup to get a 100× speedup, using objects/Maps as dictionaries to eliminate inner scans, and avoiding repeated map/filter chains to cut allocations (10–200%, about 30% typical). Implementations include graph/tree structures and binary/merge search in a video/TV app, with measurements demonstrating these fixes run on low-end TV hardware and deliver measurable performance and memory improvements.
AI-written summary · about
chapters (6)
- 0:00Introduction
- 12:34Algorithm complexity
- 21:01Arrays and objects
- 33:20Linear vs binary search
- 38:56Bubble sort to Array.sort
- 40:25Q&A
related talks
39mData structures for frontend developers
39mAlgorithms in the Front End: from V8 to VDOM
40mUsing Data-Oriented Design to Build Apps Better
28mFantastic Frontend Performance Tricks & Why We Do Them
38mThe Front End Architecture Revolution
56mFrontend Performance Optimization
23mFast by default: algorithmic performance optimization in practice
21mAlgorithms and Their Habitat