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 big O notation

Author: Will Parker



Answer:

A measure of complexity which describes the performance of an algorithm on indefinitely large datasets​ Descibes the complexity of a function


0 / 5  (0 ratings)

1 answer(s) in total