A Novel Counting Sort for Real Numberswith Linear Time Complexity-Reference-Cited by-同舟云学术

A Novel Counting Sort for Real Numberswith Linear Time Complexity

Published:2022-05-20 Issue: Volume: Page:
ISSN:
Container-title:2022 International Conference on Computational Intelligence and Sustainable Engineering Solutions (CISES)
language:
Short-container-title:

Author:

Kumar Sanjeev¹,Gaur Madhu Sharma¹,Kumar Krishan²,Sharma Prem Sagar¹

Affiliation:

1. G L Bajaj Institute of Technology and Management,Department of Computer Applications,Greater Noida,India

2. Gurukul Kangri University,Department of Computer Science,Haridwar,India

Publisher

IEEE

Link

Reference21 articles.

1. Robustness versus performance in sorting and tournament algorithms;elmenreich;Acta Polytechnica Hungarica,2009

3. Space Optimization of Counting Sort;kaul;Int J Comput Appl,2015

4. An Innovative Counting Sort Algorithm for Negative Numbers;srivastava;Int J Appl Eng Res,2018

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

2. Optically Detected Finger Recognition-Based Virtual Keyboard;2023 International Conference on Computational Intelligence and Sustainable Engineering Solutions (CISES);2023-04-28

3. A Novel Lossless Image Compression Algorithm for Optimized Memory Storage;2023 International Conference on Computational Intelligence and Sustainable Engineering Solutions (CISES);2023-04-28