Flashcards
Tree based sorting and general lessons
Flashcards do 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.
Informações
- Descrição
- Exam Algorithms & Software Concepts (Exam Questions) FlashCards sobre Tree based sorting and general lessons, criado por Finnegan Fischer em 29-04-2021.
- Criado por
- Finnegan Fischer
- Visualizações
- 0
- Avaliação