Abstract
With the growth of the Internet, processing large amounts of textual data has become a common requirement in practical applications. This paper presents an efficient algorithm, Ssort that is specialized for sorting large numbers of strings. It is an improvement over Quicksort and its variants such as Meansort. It has an excellent average case behavior. Moreover, its worst case is highly unlikely to occur in practice.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Motzkin D (1983) Meansort. Commun ACM 26(4):250–251
Hoare CAR (1961) Quicksort (Algorithm 64). Commun ACM, 4(7):321–322
Morato J et al (2004) WordNet applications. In: GWC 2004, pp 270–278
Fellbaum C (1999) WordNet: an electronic lexical database. MIT Press, Cambridge
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer Science+Business Media, LLC
About this paper
Cite this paper
Mallya, S., Mahesh, K. (2009). Ssort: Peak Analysis for Efficient String Sorting. In: Mastorakis, N., Mladenov, V., Kontargyri, V. (eds) Proceedings of the European Computing Conference. Lecture Notes in Electrical Engineering, vol 28. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-85437-3_37
Download citation
DOI: https://doi.org/10.1007/978-0-387-85437-3_37
Published:
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-84818-1
Online ISBN: 978-0-387-85437-3
eBook Packages: EngineeringEngineering (R0)