--- shuffle: true secondary_color: lightgray --- # Algorithmic complexity What is algorithmic complexity? - [ ] A measure of the execution time of an algorithm. - [ ] A measure of the memory space used by an algorithm. - [x] A measure of the execution time and memory used by an algorithm. - [ ] A measure of how complex an algorithm is. # Algorithmic complexity What are we generally interested in when we study algorithmic complexity? - [ ] Average analysis. - [ ] Pessimistic analysis. - [x] Worst-case analysis. # Algorithmic complexity What is the notation for linear and logarithmic algorithms? - [ ] $O(N)$. - [x] $O(N \cdot log(N))$. - [ ] $O(N^2)$. # Algorithmic complexity Which type of algorithm has complexity of the form $O(N^p)$? - [ ] Logarithmic algorithms. - [ ] Linear algorithms. - [ ] Polynomial algorithms. # Algorithmic complexity What causes the large number of calculations in an algorithm? - [x] The number of loops. - [ ] The number of variables. - [ ] The number of functions. # Algorithmic complexity Looking for the existence of a specific element in a list is an example of which type of complexity? - [ ] LogaExponentialrithmic complexity. - [x] Linear complexity. - [ ] Constant complexity. - [ ] Quadratic complexity.