Asymptotically optimal algorithm
id:
asymptotically-optimal-algorithm-0-16598211
title:
Asymptotically optimal algorithm
text:
In computer science, an algorithm is said to be asymptotically optimal if, roughly speaking, for large inputs it performs at worst a constant factor worse than the best possible algorithm. It is a term commonly encountered in computer science research as a result of widespread use of big-O notation. More formally, an algorithm is asymptotically optimal with respect to a particular resource if the problem has been proven to require Ω(f) of that resource, and the algorithm has been proven to use o
brand slug:
wiki
category slug:
encyclopedia
description:
Measure of algorithm performance for large inputs
original url:
https://en.wikipedia.org/wiki/Asymptotically_optimal_algorithm
date created:
date modified:
2023-08-26T21:33:14Z
main entity:
{"identifier":"Q4812191","url":"https://www.wikidata.org/entity/Q4812191"}
image:
fields total:
13
integrity:
14