Posted 18 October 2013 - 07:29 AM
Also, I think Crossbones+ members can kick or ban anyone from chat, even moderators. This should be fixed or taken away.
If a Crossbones member is abusing his or her chatroom powers you should report it to a moderator.
I haven't witnessed such a thing, I think it's more a case of people occassionally kicking someone as a joke, that's all I have actually seen. But I'm still telling about it on the chance the staff doesn't realize or hasn't listed it as something to fix. Because personally I think giving the power to every Crossbones+ member might be a little much.
I agree banning should really be a moderator-only tool. But kicking? I think it's fine to have Crossbones members be able to kick and report spammers and abusive members for when a moderator isn't around. After all, if they have the Crossbones tag it probably means they've been around the site for a while and aren't up to mischief. (unless there's been changes on how the tag is obtained, and it's possible things have changed since apparently half the membership somehow seems to be Crossbones now).
At least that's my point of view. But if the staff feels the power is best kept safe in the hands of the moderators group, I don't think anyone will complain, really. It's not like the chat is hit with waves of spam, so there should be no problem. And it used to be worse...
The slowsort algorithm is a perfect illustration of the multiply and surrender paradigm, which is perhaps the single most important paradigm in the development of reluctant algorithms. The basic multiply and surrender strategy consists in replacing the problem at hand by two or more subproblems, each slightly simpler than the original, and continue multiplying subproblems and subsubproblems recursively in this fashion as long as possible. At some point the subproblems will all become so simple that their solution can no longer be postponed, and we will have to surrender. Experience shows that, in most cases, by the time this point is reached the total work will be substantially higher than what could have been wasted by a more direct approach.
- Pessimal Algorithms and Simplexity Analysis