Skip to content

Instantly share code, notes, and snippets.

@suzaku

suzaku/notes_on_sorting.md

Created October 3, 2012 01:57
Show Gist options
  • Save suzaku/3824492 to your computer and use it in GitHub Desktop.
Save suzaku/3824492 to your computer and use it in GitHub Desktop.
Download ZIP
Raw
notes_on_sorting.md
  • stable sorting algorithms maintain the relative order of records with equal keys
  • A comparison sort examines the data only by comparing two elements with a comparison operator
  • Many integer sorting algorithms are based on the assumption that the key size "n" is large enough that all entries have unique key values, and hence that n << 2k, where << means "much less than."
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment