TIL: it is called “dynamic programming” because richard bellman (the one in bellman-ford) wanted a grandiose term that would help him secure funding during the cold war era. not that it has anything to with “dynamic” or “programming”
TIL comparison based sorting cannot beat nlogn, because arriving at a sorted order among all n! possible permutations, requires …drumroll… log(n!) comparisons at a minimum, i.e. O(nlogn)
why is this not taught in schools?
love talking to old folks about life and stuff they’ve seen it all done it all and most importantly they prove to you that everything is a comedy if you survive it and you survive things by thinking that it’s a comedy