Fichas
Tree based sorting and general lessons
Fichas del conjunto (3)
- 1Does lookup in binary search trees have the same worst case time complexity as in hash tables?No
- 2How do divide and conquer algorithms partition their input?Into two or more parts
- 3How does an already perfectly sorted input affect the running time of basic quicksort?It runs for the longest possible time for the input size.
Información
- Descripción
- Exam (Exam Questions) Algorithms & Software Concepts Fichas sobre Tree based sorting and general lessons, creado por Finnegan Fischer el 29/04/2021.
- Creado por
- Finnegan Fischer
- Visitas
- 0
- Valoración