Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,881,676 papers from all fields of science
Search
Sign In
Create Free Account
Merge sort
Known as:
Balanced merge sort
, Mergesort
, Array merging
Expand
In computer science, merge sort (also commonly spelled mergesort) is an efficient, general-purpose, comparison-based sorting algorithm. Most…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
Adaptive sort
Akra–Bazzi method
Algorithmic efficiency
All nearest smaller values
Expand
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
Junaid Tariq
,
S. Kwong
,
Hui Yuan
Journal of Visual Communication and Image…
2017
Corpus ID: 23964724
2014
2014
Merge Sort Algorithm
Jaiveer Singh
,
Raju Singh
2014
Corpus ID: 63369023
Given an array with n elements, we want to rearrange them in ascending order. Sorting algorithms such as the Bubble, Insertion…
Expand
2012
2012
A Novel Approach to Fast Image Filtering Algorithm of Infrared Images based on Intro Sort Algorithm
K. Gupta
,
Md. Rizwan Beg
,
J. Niranjan
arXiv.org
2012
Corpus ID: 16064401
In this study we investigate the fast image filtering algorithm based on Intro sort algorithm and fast noise reduction of…
Expand
2008
2008
Merge Sort Algorithm
Song Qin
2008
Corpus ID: 9085397
Given an array with n elements, we want to rearrange them in ascending order. Sorting algorithms such as the Bubble, Insertion…
Expand
2008
2008
Optimal and Practical Algorithms for Sorting on the PDM
S. Rajasekaran
,
Sandeep Sen
IEEE transactions on computers
2008
Corpus ID: 1190959
The parallel disks model (PDM) has been proposed to alleviate the I/O bottleneck that arises in the processing of massive data…
Expand
2008
2008
Ratio Based Stable In-Place Merging
Pok-Son Kim
,
Arne Kutzner
Theory and Applications of Models of Computation
2008
Corpus ID: 10161373
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…
Expand
Review
2006
Review
2006
THE ORIGIN OF THE HUBBLE SEQUENCE
R. Larson
2006
Corpus ID: 40082757
A brief review is given of the aspects of galaxy formation and evolution that are relevant to understanding the origin of the…
Expand
2002
2002
Parallel database sorting
D. Taniar
,
J. Rahayu
Information Sciences
2002
Corpus ID: 16880725
1998
1998
Support for multiway communications in ATM networks
R. Venkateswarau
,
C. Raghavendra
,
X. Chen
,
Vijay Pochampalli Kumar
IEEE ATM Workshop Proceedings. 'Meeting the…
1998
Corpus ID: 61491299
Several multimedia applications like video-conferencing and distributed interactive simulations require efficient support for…
Expand
Highly Cited
1985
Highly Cited
1985
The complexity of parallel sorting
F. Heide
,
A. Wigderson
26th Annual Symposium on Foundations of Computer…
1985
Corpus ID: 9203134
We consider PRAM's with arbitrary computational power for individual processors, infinitely large shared memory and "priority…
Expand
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)
ACCEPT & CONTINUE