3 ms·right, but tfa was about the general case where the fancy new algorithm is log(n)^nby adgjlsfhk1 3y agoright, but tfa was about the general case where the fancy new algorithm is log(n)^n