Sorting Sequences of Strings: Difference between revisions

From Algowiki
Jump to navigation Jump to search
Line 17: Line 17:
==Known algorithms==
==Known algorithms==
# [[Bucketsort]]
# [[Bucketsort]]
# [[Bubblesort]]
# [[Bubblesort]] (solves the [[Sorting based on opairwise comparison|generic sorting problem]])
# [[Mergesort]]
# [[Mergesort]]
# [[Quicksort]]
# [[Quicksort]]
# [[Selection sort]]
# [[Selection sort]]

Revision as of 11:38, 17 May 2015

Input

An ordered sequence [math]\displaystyle{ S }[/math] of length [math]\displaystyle{ n \in \mathbb{N}_{0} }[/math] and component type "string over some alphabet [math]\displaystyle{ \Sigma }[/math]."

Output

A permutation of [math]\displaystyle{ S }[/math] such that, for [math]\displaystyle{ i \in \{1,...,n-1\} }[/math], [math]\displaystyle{ S[i] }[/math] is not lexicographically larger than [math]\displaystyle{ S[i+1] }[/math].

Objective

N/A

Complexity

Linear in the total sum of all string lengths.

Known algorithms

  1. Bucketsort
  2. Bubblesort (solves the generic sorting problem)
  3. Mergesort
  4. Quicksort
  5. Selection sort