Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,782,923 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.
2014
2014
Toward robust classification using the Open Directory Project
JongWoo Ha
,
Jungho Lee
,
Won-Jun Jang
,
Yong-Ku Lee
,
SangKeun Lee
International Conference on Data Science and…
2014
Corpus ID: 15078411
The Open Directory Project (ODP) is a large scale, high quality and publicly available web directory utilized in many studies and…
Expand
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
2011
2011
A Practical Approach to Merging Multidimensional Data Models
Michael Mireku Kwakye
2011
Corpus ID: 60371723
Schema merging is the process of incorporating data models into an integrated, consistent schema from which query solutions…
Expand
2011
2011
Fast Sampling Plane Filtering , Polygon Construction and Merging from Depth Images
Joydeep Biswas
,
M. Veloso
2011
Corpus ID: 14435795
Recently, the availability of low cost depth cameras has provided 3D sensing capabilities for mobile robots in the form of dense…
Expand
2011
2011
Parallel sorting on Intel Single-Chip Cloud computer
Nicolas Melot
,
K. Avdic
,
C. Kessler
,
J. Keller
2011
Corpus ID: 14486417
The Single-Chip Cloud Computer (SCC) is an experimental processor created by Intel Labs. It comprises 48 x86 cores linked by an…
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
2007
2007
A Framework for Representing Ontology Mappings under Probabilities and Inconsistency
A. Calí
,
Thomas Lukasiewicz
,
L. Predoiu
,
H. Stuckenschmidt
Uncertainty Reasoning for the Semantic Web
2007
Corpus ID: 2657874
Creating mappings between ontologies is a common way of approaching the semantic heterogeneity problem on the SemanticWeb. To fit…
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
2005
2005
Combining local and global features for image segmentation using iterative classification and region merging
Qiyao Yu
,
David A Clausi
Canadian Conference on Computer and Robot Vision
2005
Corpus ID: 16407388
In MRF based unsupervised segmentation, the MRF model parameters are typically estimated globally. Those global statistics…
Expand
1998
1998
A Tree-based Mergesort
Alistair Moffat
,
O. Petersson
,
N. Wormald
Acta Informatica
1998
Corpus ID: 8510473
Abstract. We demonstrate that if standard Mergesort is implemented using finger search trees instead of arrays it optimally…
Expand