When teaching P vs NP  the questions arises (and if not then I bring it up) what if you have algorithm in P that takes n^{100} time?. Or even n^{5} time which might be too long. I have given the following answers for years; however, I post this and will use your comments as a sanity check. In fact, I suspect I am wrong on some points. 1) IF SAT was in P then something very clever was done. Ev