Big O myths busted! (Time complexity is complicated)
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...
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...
ZILtoid1991, Issue with tree structures are cache misses. At one point I tried to experiment with putting a whole tree into an array, but it has complexity issues.
What I use in my rendering pipeline is an automatically ordered array. It orders itself upon an insertion, and is guaranteed to stay in order.
Add comment