Related articles:
Insertion sort
Sorting algorithm
Heapsort
Divide and conquer algorithm
Quicksort
Big O notation
John von Neumann
Key terms:
n
sort
tape
merge sort
algorithm
input
output
log
chunks
array
append
linked
fewer
scratch
quicksort
recursive
comparisons
divide
implementations
sorted list
worst case
cache
alternately
mergesort
if left
integer
sorting algorithm
pseudocode
sequential
overhead
heapsort
tape drives
data structure
best case
fewer than
could look
complexity
function merge
big o notation
natural merge sort
linked list
else append
stable sort
merge sort algorithm
return result
already sorted
merge operation
two output tapes
while any records remain
implementations of merge sort
Search external links cited by footnotes on Wikipedia page Merge sort:
|
|