Název:
Sort Program for Real Keys with Linear Time Complexity
Autoři:
Jiřina, Marcel Typ dokumentu: Výzkumné zprávy
Rok:
2019
Jazyk:
cze
Edice: Technical Report, svazek: V-1272
Abstrakt: In this report we present a program for sorting data structures with sorting keys as real numbers, i.e. of type "real" or "float". The basis of the program is a modification of the countingsort algorithm for reals (instead of integers). It uses a comparision-type sorting for small part of data set given. The time complexity of this part of program can be bounded by linear function of n and thus, the total time complexity is also O(n) for n data items.
Klíčová slova:
counting sort; real sorting keys; sorting Číslo projektu: EF16_013/0001787 Poskytovatel projektu: GA MŠk
Práva: Dílo je chráněno podle autorského zákona č. 121/2000 Sb.