Flashcards
Introduction to sorting
Cards in this deck (3)
- 1If given sorting algorithm has the "stability property", that means:It keeps the ordering from the initial dataset in case of elemnts with equal sort value
- 2If you know, that your typical dataset would be pretty uniformly distributed, and the algorithms perform the most poorly when faced with reverse ordered data, which algorithm would you choose?The one with average-case complexity
O(n log n) - 3What does it mean, if a sorting algorithm is "in-place"??Does someone have the answer?
Information
- Description
- Exam Algorithms & Software Concepts (Exam Questions) Flashcards on Introduction to sorting, created by Finnegan Fischer on 29/04/2021.
- Created by
- Finnegan Fischer
- Views
- 0
- Rating