|
Organizers |
On the HeapSort Algorithm
by
Dorin Bocu
Department of Computer Science, "Transilvania" University of Brasov
Coauthors: Gheorghe Radu (Academia apararii antiaeriene si a aviatiei)
The HeapSort is a sorting algorithm that is rougly equivalent to the QuickSort; its average efficiency is O(n.logn) for an array of size n. The time proved that a significant optimization of the algorithm's performances is impossible. Thus, the algorithm's research can be centered on finding of new expression forms of the algorithm's original ideas. In this paper we propose a new approach of the HeapSort algorithm in that alternative in which the support data structure is a binary tree dinamically allocated.
Date received: March 3, 2000
Copyright © 2000 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Conferences Inc. Document # caet-14.