Number of the records: 1
Sort Program for Real Keys with Linear Time Complexity
- 1.0510947 - ÚI 2020 CZ cze V - Research Report
Jiřina, Marcel
Sort Program for Real Keys with Linear Time Complexity.
Prague: ICS CAS, 2019. Technical Report, V-1272.
R&D Projects: GA MŠMT(CZ) EF16_013/0001787
Institutional support: RVO:67985807
Keywords : 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.
Permanent Link: http://hdl.handle.net/11104/0301303
File Download Size Commentary Version Access 0510947-v1272-1.pdf 8 238.4 KB Other open-access
Number of the records: 1