Why is an algorithm designer concerned primarily?
While calculating time complexity of an algorithm, the designer concerns himself/herself primarily with the run time and not the compile time Why
a) Run time is always more than compile time.
b) Compile time is always more than run time.
c) Compile time is a function of run time.
d) A program needs to be compiled once but can be run several times.
Answer:
d) A program needs to be compiled once but can be run several times.
Why is an algorithm designer concerned primarily
Read more: All cloud computing applications suffer from the inherent