Number of the records: 1

Sort Program for Real Keys with Linear Time Complexity

SYSNO ASEP	0510947
Document Type	V - Research Report
R&D Document Type	The record was not marked in the RIV
Title	Sort Program for Real Keys with Linear Time Complexity
Author(s)	Jiřina, Marcel (UIVT-O)_{SAI, RID}
Issue data	Prague: ICS CAS, 2019
Series	Technical Report
Series number	V-1272
Language	cze - Czech
Country	CZ - Czech Republic
Keywords	sorting ; real sorting keys ; counting sort
R&D Projects	EF16_013/0001787 GA MŠMT - Ministry of Education, Youth and Sports (MEYS)
Institutional support	UIVT-O - RVO:67985807
Annotation	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.
Workplace	Institute of Computer Science
Contact	Tereza Šírová, sirova@cs.cas.cz, Tel.: 266 053 800
Year of Publishing	2020

Number of the records: 1