Asymptotic Analysis

¡Supera tus tareas y exámenes ahora con 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


Conjuntos de estudio relacionados

Chapter 9 Compensating Employees STUDY!!!!

View Set

Chapter 4: Health of the Individual, Family, and Community

View Set

ACCT 2301-01 - Chapter 11 Homework

View Set

Exam 1: Nursing Assessment: Respiratory System, Upper respiratory

View Set

PHA 381: Health Informatics Definitions

View Set

ExamFX Guarantee Missed Questions

View Set

NCLEX Prep II Renal and Urinary System

View Set

DIS 651: Quantitative Analysis (Final)

View Set