A simplified complexity analysis of mcdiarmid and reed's variant of bottom-up-heapsort

Rezaul Alam Chowdhury, M. Kaykobad, Suman Kumar Nath. A simplified complexity analysis of mcdiarmid and reed's variant of bottom-up-heapsort. Int. J. Comput. Math., 73(3):293-297, 2000. [doi]

@article{ChowdhuryKN00,
  title = {A simplified complexity analysis of mcdiarmid and reed's variant of bottom-up-heapsort},
  author = {Rezaul Alam Chowdhury and M. Kaykobad and Suman Kumar Nath},
  year = {2000},
  doi = {10.1080/00207160008804896},
  url = {https://doi.org/10.1080/00207160008804896},
  researchr = {https://researchr.org/publication/ChowdhuryKN00},
  cites = {0},
  citedby = {0},
  journal = {Int. J. Comput. Math.},
  volume = {73},
  number = {3},
  pages = {293-297},
}