Počet záznamů: 1
Nearly All Reals Can Be Sorted with Linear Time Complexity
- 1.
SYSNO ASEP 0544787 Druh ASEP V - Výzkumná zpráva Zařazení RIV Záznam nebyl označen do RIV Název Nearly All Reals Can Be Sorted with Linear Time Complexity Tvůrce(i) Jiřina, Marcel (UIVT-O) SAI, RID Vyd. údaje Prague: ICS CAS, 2021 Edice Technical Report Č. sv. edice V-1285 Poč.str. 22 s. Jazyk dok. eng - angličtina Země vyd. CZ - Česká republika Klíč. slova sorting ; algorithm ; real sorting key ; time complexity ; linear complexity CEP LM2015068 GA MŠMT - Ministerstvo školství, mládeže a tělovýchovy Institucionální podpora UIVT-O - RVO:67985807 Anotace We propose a variant of the counting sort modified for sorting reals in a linear time. It is assumed that the sorting key and pointers to the items being sorted are moved and individual items remain at the same place in the memory (in place sorting). In this case, the space complexity of the new variant of the algorithm is the same as the complexity of the quicksort. We also quantify the practical limits for possible sorting reals in a linear time. This possibility is assured under additional assumptions on the distribution of the sorting key, mainly the independence and identity of the distribution. Here we give a more general criteria easily applicable in practice. We also show that the algorithm is applicable for data that do not fulfill criteria for linear time complexity but even that the computation is faster than the system quicksort. A new, faster version of the algorithm is attached. Pracoviště Ústav informatiky Kontakt Tereza Šírová, sirova@cs.cas.cz, Tel.: 266 053 800 Rok sběru 2022
Počet záznamů: 1