Timeline for Are requests to analyze the complexity of code on-topic?
Current License: CC BY-SA 3.0
18 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 7, 2017 at 11:19 | answer | added | Simon ForsbergMod | timeline score: -3 | |
| Aug 1, 2017 at 17:25 | history | tweeted | twitter.com/StackCodeReview/status/892436053252034564 | ||
| Jul 30, 2017 at 6:57 | comment | added | 200_success Mod | @user1118321 "Better fit elsewhere" is not a consideration for determining whether a question is within the scope of Code Review. Each site decides its own rules, and there may or may not be overlap as a result. For your information, though, CS generally closes requests for complexity analysis as duplicates of this canonical question — as mentioned in a previous comment. | |
| Jul 30, 2017 at 2:50 | comment | added | user1118321 | Would the question be better off on the Computer Science Stack Exchange? | |
| Jul 28, 2017 at 19:16 | comment | added | Simon Forsberg Mod | Sorry but I thought it was an important distinction as we are discussing whether or not such questions are off-topic. | |
| Jul 28, 2017 at 19:14 | comment | added | Der Kommissar | @SimonForsberg Whatever, semantics. You know what I meant and that comment is entirely unconstructive. | |
| Jul 28, 2017 at 19:13 | comment | added | Simon Forsberg Mod | @EBrown "Unclear what you are asking" is not the same thing as "off-topic". | |
| Jul 28, 2017 at 18:20 | answer | added | Der Kommissar | timeline score: 5 | |
| Jul 28, 2017 at 18:07 | comment | added | Der Kommissar | @200_success And in regard to the question you just commented about, I feel that one is closer to dark-gray than light-gray, as it asks "what class is this" and "its complexity", without any other concern. | |
| Jul 28, 2017 at 18:06 | comment | added | Der Kommissar | @200_success For the example in your question, I feel that the author is misunderstanding the purpose of Big-O notation, or complexity analysis, and as such I think it would be off-topic as the author isn't asking what they think they're asking. | |
| Jul 28, 2017 at 18:00 | comment | added | 200_success Mod | Another recent example of question that is purely about complexity analysis of a sorting algorithm. | |
| Jul 28, 2017 at 17:02 | comment | added | Gareth Rees | On cs.stackexchange.com they close all these "easy" algorithm analysis questions (most of which are homework exercises) as duplicates of this question. | |
| Jul 28, 2017 at 14:29 | comment | added | 200_success Mod | @SimonForsberg Questions like this in general. I have been concerned about this issue for some time now; this specific question just seems to be a particularly problematic example. | |
| Jul 28, 2017 at 14:26 | comment | added | Simon Forsberg Mod | Are we talking about this question in particular or questions like this in general? | |
| Jul 28, 2017 at 10:14 | answer | added | PeilonrayzMod | timeline score: 3 | |
| Jul 28, 2017 at 9:59 | answer | added | Simon ForsbergMod | timeline score: 0 | |
| Jul 28, 2017 at 7:11 | answer | added | MastMod | timeline score: 8 | |
| Jul 27, 2017 at 21:23 | history | asked | 200_successMod | CC BY-SA 3.0 |