(definition)
Definition: The execution time of an algorithm in the worst case.
Also known as WCET.
See also worst-case cost.
Author: PEB
Go to the Dictionary of Algorithms and Data Structures home page.If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 12 August 2014.
HTML page formatted Wed Oct 30 12:15:31 2024.
Cite this as:
Paul E. Black, "worst-case execution time", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 12 August 2014. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/worstCaseExecutionTime.html
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4