Flashcards
Iteration recursion and complexity
Cards in this deck (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)
Information
- Description
- Exam Algorithms & Software Concepts (Exam Questions) Flashcards on Iteration recursion and complexity, created by Finnegan Fischer on 29/04/2021.
- Created by
- Finnegan Fischer
- Views
- 0
- Rating