Zafar, S. and Wahab, A. (2009) A New Friends Sort Algorithm. 2009 2nd IEEE International Conference on Computer Science and Information Technology, Beijing, 8-11 August 2009, 326-329.
https://doi.org/10.1109/ICCSIT.2009.5234550

has been cited by the following article:

• TITLE: Improvement of Counting Sorting Algorithm

  AUTHORS: Chenglong Song, Haiming Li

  KEYWORDS: Sort Algorithm, Counting Sorting Algorithms, Complexity, Internal Features

  JOURNAL NAME: Journal of Computer and Communications, Vol.11 No.10, October 12, 2023

  ABSTRACT: By analyzing the internal features of counting sorting algorithm. Two improvements of counting sorting algorithms are proposed, which have a wide range of applications and better efficiency than the original counting sort while maintaining the original stability. Compared with the original counting sort, it has a wider scope of application and better time and space efficiency. In addition, the accuracy of the above conclusions can be proved by a large amount of experimental data.