stella v0.4.0 Quicksort

Documentation for Quick sort algorithm. All important informations about counting sort you can find on Wikipedia page.

Annotations

  • n - number of elements in list

Link to this section Summary

Functions

Sort list

Link to this section Functions

Sort list

  • Pesimistic complexity: O(n^2)
  • Normal complexity: O(nlgn)

Examples

iex> Quicksort.run([4, 1, 3, 2])
[1, 2, 3, 4]

iex> Quicksort.run([-2.0, 0, 4, 1, 3, 2])
[-2.0, 0, 1, 2, 3, 4]