Viewing topic: Merge sort

See sub-topics for Merge sort ... >> Theory >> Algorithm >> Merge sort

Highest Rated Sign

No video has been submitted for this term

Nobody has posted a sign yet.

Merge sort

  • Definition: is an comparison-based sorting algorithm. It is stable, meaning that it preserves the input order of equal elements in the sorted output. It is an example of the divide and conquer algorithmic paradigm.

    Source: Reges & Stepp, 2007

  • Example: is an comparison-based sorting algorithm. It is stable, meaning that it preserves the input order of equal elements in the sorted output. It is an example of the divide and conquer algorithmic paradigm.

  • There are no comments for this topic.