Original title: Sort Program for Real Keys with Linear Time Complexity
Authors: Jiřina, Marcel
Document type: Research reports
Year: 2019
Language: cze
Series: Technical Report, volume: V-1272
Abstract: 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.
Keywords: counting sort; real sorting keys; sorting
Project no.: EF16_013/0001787
Funding provider: GA MŠk

Institution: Institute of Computer Science AS ČR (web)
Document availability information: Fulltext is available on demand via the digital repository of the Academy of Sciences.
Original record: http://hdl.handle.net/11104/0301303

Permalink: http://www.nusl.cz/ntk/nusl-407908

The record appears in these collections:
Research > Institutes ASCR > Institute of Computer Science
Reports > Research reports
 Record created 2019-11-25, last modified 2020-03-26

No fulltext
  • Export as DC, NUŠL, RIS
  • Share