Karteikarten
Iteration recursion and complexity
Karten in diesem Stapel (3)
- 1What is the runtime complexity of this code?0(n)
- 2What is the runtime complexity of this code?O(n^2)
- 3If the given function executes 11n23*n/13 operations, what is it's runtime complexity?O(n^2)
Informationen
- Beschreibung
- Exam Algorithms & Software Concepts (Exam Questions) Karteikarten am Iteration recursion and complexity, erstellt von Finnegan Fischer am 29/04/2021.
- Erstellt von
- Finnegan Fischer
- Aufrufe
- 0
- Bewertung