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