Cook, C. and Kim, D. (1980) Best Sorting Algorithm for Nearly Sorted Lists. CACM, 23, 620-626.
https://doi.org/10.1145/359024.359026

has been cited by the following article:

• TITLE: Heap Sorting Based on Array Sorting

  AUTHORS: Haiming Li, Ping Chen, Yong Wang

  KEYWORDS: Heap Sort, Array, Bottom-Up, Algorithm

  JOURNAL NAME: Journal of Computer and Communications, Vol.5 No.12, October 30, 2017

  ABSTRACT: A kind of heap sorting method based on array sorting was proposed. Some advantages and disadvantages of it were discussed. It was compared with the traditional method of direct application. In the method, the ordered keywords in the array are put into the heap one by one after building an empty heap. This method needs relatively less space and is fit for ordered sequence.