Abstract:
Quadratic sorting algorithms such as Selectionsort are valued for their simplicity, in-place property, and good performance on small input. On the other hand, a straightf...Show MoreMetadata
Abstract:
Quadratic sorting algorithms such as Selectionsort are valued for their simplicity, in-place property, and good performance on small input. On the other hand, a straightforward Mergesort is optimal, but has a linear space requirement. This paper explores the use of sorted granules built using Mergesort with bounded space requirement in order to increase the efficiency of an in-place stable quadratic sort.
Published in: 2009 IEEE International Conference on Granular Computing
Date of Conference: 17-19 August 2009
Date Added to IEEE Xplore: 22 September 2009
Print ISBN:978-1-4244-4830-2