Sorting Algorithms: Difference between revisions

From NovaOrdis Knowledge Base
Jump to navigation Jump to search
No edit summary
No edit summary
Line 18: Line 18:


=Sorting Algorithms=
=Sorting Algorithms=
==Comparison Sort==


* [[Insertion Sort#Overview|Insertion sort]]
* [[Insertion Sort#Overview|Insertion sort]]
* [[Merge Sort#Overview|Merge sort]]
* [[Merge Sort#Overview|Merge sort]]
==Non-Compartison Sort==

Revision as of 04:14, 5 August 2018

Internal

Overview

Many programs use sorting as an intermediate step, and that is why sorting is considered a fundamental operation in computer science.

The sorting problem if formally defined as follows: given a sequence of n numbers (a1, a2, ... an) provided as input, the algorithm must produce as output a permutation (reordering) (a'1, a'2, ... a'n) of the input sequence such that a'1 ≤ a'2 ≤ ... ≤ a'n. A specific input sequence is called an instance of the sorting problem.

Comparison sort. Cannot do better than n ln n. Proof in a separate article.

Non-comparison sort.

Sorting algorithms characteristics:

  • in-place
  • stability

Sorting Algorithms