Time complexity Computer Science Fundamentals
noun phrase
Definition: A measure of the amount of computational time an algorithm requires as a function of input size, typically expressed with asymptotic notation (e.g., Big-O) [Bakanach 2023/2024].
Example in context: “High time complexity is the key limitation of these measures.” [Wang et al. 2024]
Related terms: computational complexity (broader), runtime complexity, Big-O complexity