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)

Related topics

Related topics

50 relations
Adaptive sortAkra–Bazzi methodAlgorithmic efficiencyAll nearest smaller values

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Spatial/temporal motion consistency based MERGE mode early decision for HEVC
2014
2014
Merge Sort Algorithm
Given an array with n elements, we want to rearrange them in ascending order. Sorting algorithms such as the Bubble, Insertion… 
2011
2011
A Practical Approach to Merging Multidimensional Data Models
Schema merging is the process of incorporating data models into an integrated, consistent schema from which query solutions… 
2009
2009
A new friends sort algorithm
Sorting algorithms and the sorting itself is an important concept in computational field. In this research study, we are… 
2008
2008
Merge Sort Algorithm
Given an array with n elements, we want to rearrange them in ascending order. Sorting algorithms such as the Bubble, Insertion… 
2008
2008
Optimal and Practical Algorithms for Sorting on the PDM
The parallel disks model (PDM) has been proposed to alleviate the I/O bottleneck that arises in the processing of massive data… 
2008
2008
GPU Bucket Sort Algorithm with Applications to Nearest-neighbour Search
We present an adoption of the bucket sort algorithm capable of running entirely on GPU architecture. Our implementation employs… 
Review
2006
Review
2006
THE ORIGIN OF THE HUBBLE SEQUENCE
A brief review is given of the aspects of galaxy formation and evolution that are relevant to understanding the origin of the… 
1998
1998
Support for multiway communications in ATM networks
Several multimedia applications like video-conferencing and distributed interactive simulations require efficient support for… 
Highly Cited
1985
Highly Cited
1985
The complexity of parallel sorting
We consider PRAM's with arbitrary computational power for individual processors, infinitely large shared memory and "priority… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)