When writing or using an algorithm, should the Big Oh complexity be mentioned?
closed as not constructive by user40980, user53019, Martijn Pieters, Frank Shearar, user7007 Feb 12 '13 at 19:00
As it currently stands, this question is not a good fit for our Q&A format. We expect answers to be supported by facts, references, or expertise, but this question will likely solicit debate, arguments, polling, or extended discussion. If you feel that this question can be improved and possibly reopened, visit the help center for guidance. If this question can be reworded to fit the rules in the help center, please edit the question.
If you can back it up with real analysis, then yes, absolutely.
@Casebash test != analysis. If it should always be documented then just start throwing
// this algorithm is O(n!)
on every function.
I've worked with people who would say things like 'This function is O(1) because there are no loops', and then I would point to the call