Asymptotic Analysis
Ace your homework & exams now with Quizwiz!
asymptotically
compare functions for large values of n, that is compare functions in the limit
algorithm
finite set of precise instructions which are performed to solve a problem
running time
function of the input size, that is f(n)
best case
provides a lower bound on running time on input for which algorithm runs the fastest
average case
provides a prediction about running time assuming input is random
worst case
provides an upper bound on running time guaranteeing that the algorithm would not run longer
