SEARCH
You are in browse mode. You must login to use MEMORY

   Log in to start


From course:

Computer Science AQA A level

» Start this Course
(Practice similar questions for free)
Question:

Define time complexity?

Author: Will Parker



Answer:

The time complexity of an algorithm is the rate of growth of the number of operations in relation to the quantity of input data Measurement of the amount of time required by an algorithm for a given input of size (n) to solve


0 / 5  (0 ratings)

1 answer(s) in total