Sort Program for Real Keys with Linear Time Complexity

0510947 - ÚI 2020 CZ cze V - Výzkumná zpráva
Jiřina, Marcel
Sort Program for Real Keys with Linear Time Complexity.
Prague: ICS CAS, 2019. Technical Report, V-1272.
Grant CEP: GA MŠMT(CZ) EF16_013/0001787
Institucionální podpora: RVO:67985807
Klíčová slova: sorting * real sorting keys * counting sort

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.
Trvalý link: http://hdl.handle.net/11104/0301303