Results 1 
3 of
3
A New Data Structure for Heapsort with Improved Number of Comparisons (Extended Abstract)
"... Abstract. In this paper we present a new data structure for implementing heapsort algorithm for pairs of which can be simultaneously stored and processed in a single register. Since time complexity of Carlsson type variants of heapsort has already achieved a leading coefficient of 1, concretely nlg ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
Abstract. In this paper we present a new data structure for implementing heapsort algorithm for pairs of which can be simultaneously stored and processed in a single register. Since time complexity of Carlsson type variants of heapsort has already achieved a leading coefficient of 1, concretely nlg n + nlg lg n, and lower bound theory asserts that no comparison based inplace sorting algorithm can sort n data in less than ⌈lg(n!) ⌉ ≈ n lg n − 1.44n comparisons on the average, any improvement in the number of comparisons can only be achieved in lower terms. Our new data structure results in improvement in the linear term of the time complexity function irrespective of the variant of the heapsort algorithm used. This improvement is important in the context that some of the variants of heapsort algorithm, for example weak heapsort although not inplace, are near optimal and is away from the theoretical bound on number of comparisons by only 1.54n.
Project Title: A New Heap Data Structure S.S.Bansal (98357) Supervisor: Dr. Phalguni Gupta
, 2002
"... In this report a new data strucutre named Mheaps is proposed. This data structure is a modi cation of the well known binary heap data structure. The new structure supports insertion in constant time and deletion in O(log n) time. Finally a generalization of the data structure to d ary Mheaps is p ..."
Abstract
 Add to MetaCart
In this report a new data strucutre named Mheaps is proposed. This data structure is a modi cation of the well known binary heap data structure. The new structure supports insertion in constant time and deletion in O(log n) time. Finally a generalization of the data structure to d ary Mheaps is presented. This structure has similar timebounds for insertion and deletion.