On Tuesday, 15 December 2015 at 13:47:20 UTC, Ola Fosheim Grøstad
wrote:
On Tuesday, 15 December 2015 at 12:28:02 UTC, ZombineDev wrote:
Not everybody is licensed in computational complexity theory
to understand what O(n) means.
LOL. Personally, I would never want to use any software
written by a programmer, who can't tell the difference.
Well ok, let's consider a novice programmer who hasn't studied
yet complexity theory.
Most experienced programmers have a _very_ poor understanding
of complexity theory, the associated notation and applicability.
A little bit of sloppy O(1), O(log N) and O(N), is ok, but for
anything more than that it becomes more confusing than useful.
E.g. the effects are not necessarily measurable for your
program. You need more accurate descriptions to understand the
effects than O(N^2).
I never said that you need to be an expert, but at least you
should be able to tell the difference between O(n) and O(1) like
in this particular case. This is very basic stuff.