Number of the records: 1
A Criterion for Sorting Reals in a Linear Time
- 1.
SYSNO ASEP 0556781 Document Type C - Proceedings Paper (int. conf.) R&D Document Type Conference Paper Title A Criterion for Sorting Reals in a Linear Time Author(s) Jiřina, Marcel (UIVT-O) SAI, RID Number of authors 1 Source Title Proceedings of Seventh International Congress on Information and Communication Technology. ICICT 2022, London, Volume 4, Volume 4. - Singapore : Springer, 2022 / Yang X.-S. ; Sherratt S. ; Dey N. ; Joshi A. - ISBN 978-981-19-2396-8 Pages s. 437-447 Number of pages 11 s. Publication form Print - P Action ICICT 2022: International Congress on Information and Communication Technology /7./ Event date 21.02.2022 - 24.02.2022 VEvent location London / Virtual Country GB - United Kingdom Event type WRD Language eng - English Country SG - Singapore Keywords sorting reals ; counting sort ; time complexity ; space complexity OECD category Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8) R&D Projects LM2015068 GA MŠMT - Ministry of Education, Youth and Sports (MEYS) Institutional support UIVT-O - RVO:67985807 UT WOS 000894285700040 EID SCOPUS 85136913682 DOI 10.1007/978-981-19-2397-5_41 Annotation We quantify the practical limits for sorting reals in a linear time. This possibility is assured under assumption on the distribution of the sorting key, mainly the independence and identity of the distribution. Here we give a more general criteria easily applicable in practice. We also show that the algorithm is applicable for data that do not fulfill criteria for linear time complexity but even that the computation is faster than the system quicksort. Workplace Institute of Computer Science Contact Tereza Šírová, sirova@cs.cas.cz, Tel.: 266 053 800 Year of Publishing 2023 Electronic address https://dx.doi.org/10.1007/978-981-19-2397-5_41
Number of the records: 1