Second Lecture on Adversary Lower Bounds

Continuation and completion of the adversary argument to establish the
lower bound of 1.5n comparisons needed for finding the median of n numbers. Final
comments on lower bounds.

[@chenghaowang8759]

so helpful, thank you!

[@Ben-vu6ec]

26:49

[@josephsindelar2839]

What the fuck is the point of this? I swear to god algorithms is such bullshit. How is this any different from just assuming worst case?

[@pablote325]

omg you are actually stupid HAHAH

[@gabrieldjebbar7098]

The adversary technique is all about how to construct the "worst case" for a given algorithm.