Karteikarten
Tree based sorting and general lessons
Karten in diesem Stapel (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.
Informationen
- Beschreibung
- Exam Algorithms & Software Concepts (Exam Questions) Karteikarten am Tree based sorting and general lessons, erstellt von Finnegan Fischer am 29/04/2021.
- Erstellt von
- Finnegan Fischer
- Aufrufe
- 0
- Bewertung