Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Asymptotic optimal HEAPSORT algorithm

From MaRDI portal
Publication:1341734
Jump to:navigation, search

DOI10.1016/0304-3975(94)00113-8zbMath0938.68959OpenAlexW2093634767MaRDI QIDQ1341734

Xunrang Gu, Yuzhang Zhu

Publication date: 16 February 1995

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(94)00113-8



Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)


Related Items (2)

Optimizing binary heaps ⋮ Optimal heapsort algorithm




Cites Work

  • A Simple Modification of Xunrang and Yuzhang'S HEAPSORT Variant Improving its Complexity Significantly
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item




This page was built for publication: Asymptotic optimal HEAPSORT algorithm

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1341734&oldid=13474965"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 13:33.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki