Big O myths busted! (Time complexity is complicated)
Channel: strager
Date: 2023-05-09

Is O(log n) better than O(n)? In this video we talk about algorithms, time complexity, and why it's sometimes confusing.

Buy 🦀 Rust stickers: https://strager.net/booty

00:00 what is the best algorithm?
00:16 locating errors
01:28 benchmarking the naïve algorithm
02:08 analyzing the naïve algorithm
04:33 the line tables algorithm
05:44 benchmarking the line tables
08:06 a fair comparison
09:48 binary search
10:43 analyzing binary search
12:49 benchmarking binary search
14:28 coding SIMD
18:34 pop quiz answers

Thanks:
Jennipuff: https://www.instagram.com/jenipuff/

Attribution:
Thumbnail artwork and photography by Jennipuff
Sound effects: https://pixabay.com/sound-effects/sfx-motorcycle-doppler-101211/ https://pixabay.com/sound-effects/car-accident-with-squeal-and-crash-6054/