Definition: (1) The amount of time needed to execute an algorithm. (2) The time when a compiled program is executing, versus compile time.
See also big-O notation, polynomial time.
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 17 December 2004.
HTML page formatted Fri Mar 25 16:20:35 2011.
Cite this as:
Patrick Rodgers, "run time", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed., U.S. National Institute of Standards and Technology. 17 December 2004. (accessed TODAY) Available from: http://www.nist.gov/dads/HTML/runtime.html