Abstract
In the field of computer science and mathematics, Sorting is arranging elements in a certain order, there are many sorting techniques are existing such as Bubble sort, Heap sort, Merge sort, Insertion sort etc. In this paper we are concentrating on heap sort, heap sort works by first organizing the data to be sorted into a special type of binary tree called a heap. The heap itself has, by definition the largest value or the smallest value at the top of the tree based on max heap or min heap. Heap sort method sorts a single element at a time. In the existing heap sort method for every construction of heap only a single root element will be sorted, so it slowdowns the performance of heap sort technique. In order to optimize the performance of heap sort we are proposing the optimized heap sort technique (OHS) by using Two-swap method. The Two-swap method sorts two-elements at a time for each heap construction, and it reduces 30-50% of the time complexity of heap sort in the construction of heap as well as in sorting of array elements.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn., ch. 7. MIT Press, Cambridge (2001)
Knuth, D.E.: The Art of Computer Programming. Sorting and Searching, vol. 3. Addison Wesley, Reading (1998)
Floyd, R.W.: Algorithm 245: Treesort 3. Communications of ACMÂ 7(4), 701 (1964)
Cormen, et al.: Introduction to Algorithms, Chap. 6
Hoare, C.A.R.: Quicksort. Computer Journal 5(1), 10–15
Williams, J.W.J.: Algorithm 232: HEAPSORT. Communications of ACM 7(4), 347–348 (1964)
Wegner, I.: The Worst Case Complexity of McDiarmid and Reed’s Variant of BOTTOM-UP HEAP SORT. Information and Computation 97(1), 86–96 (1992)
Carlsson, S.: A variant of HEAPSORT with almost optimal number of comparisons. Information Processing Letters 24, 247–250 (1987)
Gonnet, G.H., Munro, J.I.: Heaps on Heaps. SIAM Journal on Computing 15(6), 964–971 (1986)
McDiarmid, C.J.H., Reed, B.A.: Building Heaps Fast. Journal of Algorithms 10(3), 352–365 (1989)
Dutton, R.D.: Weak Heap Sort. BIT 33(3), 372–381 (1993)
Carlsson, S., Chen, J.: The Complexity of Heaps. In: The Third Annual ACM SIAM Symposium on Discrete Algorithms, pp. 393–402. SIAM, Philadelphia (1992)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Sumathi, S., Prasad, A.M., Suma, V. (2015). Optimized Heap Sort Technique (OHS) to Enhance the Performance of the Heap Sort by Using Two-Swap Method. In: Satapathy, S., Biswal, B., Udgata, S., Mandal, J. (eds) Proceedings of the 3rd International Conference on Frontiers of Intelligent Computing: Theory and Applications (FICTA) 2014. Advances in Intelligent Systems and Computing, vol 327. Springer, Cham. https://doi.org/10.1007/978-3-319-11933-5_78
Download citation
DOI: https://doi.org/10.1007/978-3-319-11933-5_78
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-11932-8
Online ISBN: 978-3-319-11933-5
eBook Packages: EngineeringEngineering (R0)