20.500.12556/RUL-135643 Gradnja in analiza urejevalnih dreves Building and analysis of sorting trees V diplomski nalogi obravnavamo gradnjo in analizo dreves za urejanje z operacijo primerjanja. Ta drevesa vsebujejo vsa možna primerjanja, ki jih algoritmi za urejanje s primerjanjem lahko opravijo, da uredijo dano tabelo števil. S temi drevesi lahko na primer izpeljemo natan£no spodnjo mejo za £asovno zahtevnost urejanja s primerjanjem, v nalogi pa poskušamo poiskati še druge njihove lastnosti in ugotoviti njihovo uporabnost. V nalogi prav tako obravnavamo uporabo takšnih dreves v praksi in njihove omejitve. 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. drevo urejanje s primerjanjem izomorfizem neobrezana drevesa popolnoma obrezana drevesa delno obrezana drevesa tree sorting on base of comparison ismorphism uncut trees completely cut trees partially cut trees true false false Slovenski jezik Angleški jezik Diplomsko delo/naloga 2022-03-23 11:40:08 2022-03-23 11:40:14 2022-09-14 04:14:25 0000-00-00 00:00:00 2022 0 0 0000-00-00 NiDoloceno NiDoloceno NiDoloceno 0000-00-00 0000-00-00 0000-00-00 32723 102703619 Savnik_Jure_-_Gradnja_in_analiza_urejevalnih_dreves.pdf Savnik_Jure_-_Gradnja_in_analiza_urejevalnih_dreves.pdf 1 82C0D2D4B375053DF5AF7AB27CC128C2 1b0b96d2e3acc8cc382b5b975357036a8d96bd35bb8f83f8296168b8296b9196 a2ad65ee-aa95-11ec-8aca-00155dcfd717 https://repozitorij.uni-lj.si/Dokument.php?lang=slv&id=154848 Fakulteta za računalništvo in informatiko 0 0 0