I foresee a number of topics that will probably come up again and again on this site in the future. As one has already been asked, I think we may want to come up with a policy for these types of topics while we're still in beta.
The topic in question is 'how to determine the running time of an algorithm', asked here.
This is a very fundamental question to CS; it is one of the basic topis that comes up again and again. However, the question asked there is also very broad: a proper answer would be quite long, as it would essentially contain several lectures' worth of information.
I don't see any easy way of constraining the question such that it becomes answerable with a shorter answer - note that the question 'what is the running time of this algorithm' is a different kind of question, though very closely related: the first asks about techniques, the second about a single answer.
Another one will be 'how does big-oh notation work?', 'how can I write my own compiler?', and others I can't think of right now.
I see two ways to deal with these kinds of questions.
- Shoot them down on sight. Questions that are too broad like this will be closed (I think as 'not a real question', but I could be wrong). The reasoning would be 'these questions are too broad, you may be better off taking a course somewhere'.
- Have a single question with one (or more) big answers, giving a lot of information about the subject. Close all other questions that will pop up as duplicates of the first one, and hope that people visit the linked question and either get their answer there, or be provided with enough information to ask a directed, narrower question.
Which option is preferable? Is there an option 3? Am I predicting this completely wrong?