|
gptkbp:instanceOf
|
gptkb:algorithm
|
|
gptkbp:canBeImplementedIteratively
|
true
|
|
gptkbp:canBeImplementedRecursively
|
true
|
|
gptkbp:designedBy
|
gptkb:John_von_Neumann
|
|
gptkbp:firstPublished
|
gptkb:Annals_of_Mathematical_Statistics
|
|
gptkbp:hasVariant
|
bottom-up mergesort
natural mergesort
top-down mergesort
|
|
gptkbp:hasWorstCasePerformanceBetterThan
|
gptkb:Quicksort
|
|
gptkbp:introducedIn
|
1945
|
|
gptkbp:isComparisonBased
|
true
|
|
gptkbp:isComparisonSort
|
true
|
|
gptkbp:isDeterministic
|
true
|
|
gptkbp:isDivideAndConquer
|
true
|
|
gptkbp:isExternalSort
|
true
|
|
gptkbp:isInPlace
|
false
|
|
gptkbp:isNotAdaptive
|
true
|
|
gptkbp:isNotInPlace
|
true
|
|
gptkbp:isParallelizable
|
true
|
|
gptkbp:isRecursive
|
true
|
|
gptkbp:isStableSort
|
true
|
|
gptkbp:nameOrigin
|
merge operation used in the algorithm
|
|
gptkbp:relatedTo
|
gptkb:Timsort
gptkb:Quicksort
gptkb:Heapsort
|
|
gptkbp:spaceComplexity
|
O(n)
|
|
gptkbp:stable
|
true
|
|
gptkbp:timeComplexityAverage
|
O(n log n)
|
|
gptkbp:timeComplexityBest
|
O(n log n)
|
|
gptkbp:timeComplexityWorst
|
O(n log n)
|
|
gptkbp:usedFor
|
sorting arrays
sorting linked lists
|
|
gptkbp:usedIn
|
gptkb:GNU_sort
gptkb:Timsort
gptkb:Java_standard_library
gptkb:Python_standard_library
|
|
gptkbp:bfsParent
|
gptkb:Quicksort
|
|
gptkbp:bfsLayer
|
6
|
|
https://www.w3.org/2000/01/rdf-schema#label
|
Mergesort
|