This bachelor’s thesis deals with the construction and analysis of sorting
trees. It looks at trees that contain all possible comparisons that sorting algorithms
with comparisons can make so that we get sorted table. With such trees we can, for
example, calculate theoretically possible time complexity of algorithms based on
comparisons. This thesis looks for other characteristics of the trees and attempts to
show whether they have any uses. It also takes into consideration the use of such
things in practice and their limitations.
|
