Best, worst and average case
id:
best-worst-and-average-case-252-6839391
title:
Best, worst and average case
text:
In computer science, best, worst, and average cases of a given algorithm express what the resource usage is at least, at most and on average, respectively. Usually the resource being considered is running time, i.e. time complexity, but could also be memory or some other resource.
Best case is the function which performs the minimum number of steps on input data of n elements. Worst case is the function which performs the maximum number of steps on input data of size n. Average case is the funct
brand slug:
wiki
category slug:
encyclopedia
description:
A measure of how efficiently algorithms use resources
original url:
https://en.wikipedia.org/wiki/Best,_worst_and_average_case
date created:
date modified:
2024-03-03T21:09:34Z
main entity:
{"identifier":"Q186094","url":"https://www.wikidata.org/entity/Q186094"}
image:
fields total:
13
integrity:
14