AQA A-level computer science | Complexity of algorithms
Time complexity of algorithm with no loops or recursion (simple operation) - O(1) Time complexity of an algorithm that iterates over an array of length n - O(n) Time complexity of an algorithm that iterates over an array of length n within an iteration of another array of length n - O(n^2) Time complexity of linear search - O(n)
Written for
- Institution
- AQA A
- Course
- AQA A
Document information
- Uploaded on
- December 7, 2022
- Number of pages
- 1
- Written in
- 2022/2023
- Type
- Exam (elaborations)
- Contains
- Answers
Subjects
-
time complexity of algorithm with no loops or recursion simple operation o1 time complexity of an algorithm that iterates over an array of length n on time complexity of an algorithm that it