Ssort: Peak Analysis for Efficient String Sorting

  • Sunil Mallya
  • Kavi Mahesh
Conference paper
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 28)


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.


Sorting Algorithm Maximum Count Partition Ratio Good Partition Peak Element 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Motzkin D (1983) Meansort. Commun ACM 26(4):250–251CrossRefGoogle Scholar
  2. 2.
    Hoare CAR (1961) Quicksort (Algorithm 64). Commun ACM, 4(7):321–322Google Scholar
  3. 3.
    Morato J et al (2004) WordNet applications. In: GWC 2004, pp 270–278Google Scholar
  4. 4.
    Fellbaum C (1999) WordNet: an electronic lexical database. MIT Press, CambridgeGoogle Scholar
  5. 5.

Copyright information

© Springer Science+Business Media, LLC 2009

Authors and Affiliations

  1. 1.Department of Computer Science and EngineeringPES Institute of TechnologyBangalore 560085India

Personalised recommendations