Question
A programmer needs describing scalability independent of machine speed, and the chosen structure has the property that constant factors and lower-order terms are ignored asymptotically. Which choice fits best?
Select an option. Your answer will be checked instantly.
Correct Answer: D. Big-O Notation
Explanation:
Big-O Notation fits because it supports describing scalability independent of machine speed and constant factors and lower-order terms are ignored asymptotically.
Both clues point to this choice.
Leave a Reply