Why use asymptotic notation instead of running time or operation counts? When do

Q: Why use asymptotic notation instead of running time or operation counts? When do

asymptotic analysis The big-Oh notation is used widely to characterize running times and space bounds The big-Oh notation allows us to ignore constant factors and lower order terms and focus on the main components of a function which affect its growth

ID: 3551423 • Letter: W

Question

Why use asymptotic notation instead of running time or operation counts?
When does it make more or less sense?
Why invent a system of notation where multiplying by an algorithms running time by two does not seem to make it asymptotically faster?
How would you explain assymptotic notation to someone else?
Would you recommend a coding standard that EVERY function must include its asymptotic complexity in its documentation?
How important do you think it is to understand and be able to calculate asymptotic complexity?
Do you think asymptotic notation is an academic's diversion or does it matter in the "real world"?
What would be an unfair exam question involving asymptotic notation?
Have you ever used a StringBuilder in java? Why is it preferred over using string concatenation?

Explanation / Answer

asymptotic analysis The big-Oh notation is used widely to characterize running times and space bounds The big-Oh notation allows us to ignore constant factors and lower order terms and focus on the main components of a function which affect its growth

Navigate

Why use APA standard for documenting? What is plagiarizing? When formulating a s

Why use autocorrelation instead of autocovariance when examining stationary time

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.

Why use asymptotic notation instead of running time or operation counts? When do

Question

Explanation / Answer

Related Questions

Navigate