Skip to search formSkip to main contentSkip to account menu

Merge sort

Known as: Balanced merge sort, Mergesort, Array merging 
In computer science, merge sort (also commonly spelled mergesort) is an efficient, general-purpose, comparison-based sorting algorithm. Most… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Given an array with n elements, we want to rearrange them in ascending order. Sorting algorithms such as the Bubble, Insertion… 
2012
2012
In this study we investigate the fast image filtering algorithm based on Intro sort algorithm and fast noise reduction of… 
2008
2008
Given an array with n elements, we want to rearrange them in ascending order. Sorting algorithms such as the Bubble, Insertion… 
2008
2008
The parallel disks model (PDM) has been proposed to alleviate the I/O bottleneck that arises in the processing of massive data… 
2008
2008
We investigate the problem of stable in-place merging from a ratio k = n/m based point of view where m, n are the sizes of the… 
Review
2006
Review
2006
A brief review is given of the aspects of galaxy formation and evolution that are relevant to understanding the origin of the… 
1998
1998
Several multimedia applications like video-conferencing and distributed interactive simulations require efficient support for… 
Highly Cited
1985
Highly Cited
1985
We consider PRAM's with arbitrary computational power for individual processors, infinitely large shared memory and "priority…