Clark's select

[@erickinder8488]

Terrific lecture series! I think you do a great job, but I think concrete examples here (like you do earlier) would help for those who haven't developed an intuition for log base 2 yet and what it does at scale. I got tripped up by n = 1024 since sparse would be > 1000. I realized that as n gets really big, the proportion that is dense gets larger. If n = 1,125,899,906,842,624 (2^50), sparse is only > 6,250,000.

[@denvaar]

Is that trick where you move the 4 from the exponent to be a multiplicative constant just because of the big O? Or is that a property of logarithms?