Sorry if this is an old topic.
I see several stack overflow questions about algorithm scaling: e.g. what does O(nlog(n)) mean? Does O(n log(n)) scale faster than O(n^(1 + k))?
I frequently see them shut down, but I also see them appear over and over again, and often get upvoted as popular questions. I also see some very prominent ones that have never been shut down.
Links to three example questions below:
This one discusses the meaning of O(log n) (80+ votes)
This is essentially a homework discussion. (25+ votes)
This is a recent one I was involved in, recently closed, then re-opened.
Normally I've ignored these questions, since they seem a bit too mathematical and homework-like. When I'd check on them later, they were sometimes closed, sometimes not. I took a stab at this recent one, and it too was closed.
Is there an official and/or unofficial position on these sort of questions?