Skip to content
#

mergesort-algorithm

Here are 90 public repositories matching this topic...

As a divide-and-conquer algorithm, Mergesort breaks the input array into subarrays and recursively sort them. When the sizes of sub-arrays are small, the overhead of many recursive calls makes the algorithm inefficient. This problem can be remedied by choosing a small value of S as a threshold for the size of sub-arrays. When the size of a sub-a…

  • Updated Oct 27, 2017
  • C

Improve this page

Add a description, image, and links to the mergesort-algorithm topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the mergesort-algorithm topic, visit your repo's landing page and select "manage topics."

Learn more