ÒComplexityÓ in the
algorithm-analysis context
l
means the cost of a program's
execution
l
(in running time, memory, ...)
l
rather than
l
the cost of
creating
the program
l
(in # of statements, development time, ...)
l
l
In this context,
less
-complex programs may
require
more
development time.