In computer science, merge sort (also commonly spelled as mergesort) is an efficient, general-purpose, and comparison-based sorting algorithm. Most implementations...

A polyphase merge sort is a variation of a bottom-up merge sort that sorts a list using an initial uneven distribution of sub-lists (runs), primarily used...

In computer science, merge-insertion sort or the Ford–Johnson algorithm is a comparison sorting algorithm published in 1959 by L. R. Ford Jr. and Selmer...

Oscillating merge sort or oscillating sort is a variation of merge sort used with tape drives that can read backwards. Instead of doing a complete distribution...

sorting is important for optimizing the efficiency of other algorithms (such as search and merge algorithms) that require input data to be in sorted lists...

Cascade merge sort is similar to the polyphase merge sort but uses a simpler distribution. The merge is slower than a polyphase merge when there are fewer...

distribution sorting, which resembles quicksort, and external merge sort, which resembles merge sort. External merge sort typically uses a hybrid sort-merge strategy...

more advanced algorithms such as quicksort, heapsort, or merge sort. However, insertion sort provides several advantages: Simple implementation: Jon Bentley...

More efficient algorithms such as quicksort, timsort, or merge sort are used by the sorting libraries built into popular programming languages such as...

Block sort, or block merge sort, is a sorting algorithm combining at least two merge operations with an insertion sort to arrive at O(n log n) (see Big...

inputs lists in sorted order. These algorithms are used as subroutines in various sorting algorithms, most famously merge sort. The merge algorithm plays...

Timsort is a hybrid, stable sorting algorithm, derived from merge sort and insertion sort, designed to perform well on many kinds of real-world data....

1961. It is still a commonly used algorithm for sorting. Overall, it is slightly faster than merge sort and heapsort for randomized data, particularly...

The sort-merge join (also known as merge join) is a join algorithm and is used in the implementation of a relational database management system. The basic...

Mainframe sort merge, sort utility for IBM mainframe systems Merge sort, computer sorting algorithm Radix sort, sorting algorithm Sort (Unix), which sorts the...

k-way merge algorithms or multiway merges are a specific type of sequence merge algorithms that specialize in taking in k sorted lists and merging them...

considered to be a sorted list of one element, and continues through all the columns until the last merges them into a single, sorted list. Because the...

shaker sort is used primarily as an educational tool. More performant algorithms such as quicksort, merge sort, or timsort are used by the sorting libraries...

Finally, sort the two segments recursively. Merge sort: Divide the list of elements in two parts, sort the two parts individually and then merge it. Various...

used as well, such as selection sort or merge sort. Using bucketSort itself as nextSort produces a relative of radix sort; in particular, the case n = 2...

migrated across media in rolling batches, using an algorithm reminiscent of merge sort. Such tuning involves writing data in a sequential manner as opposed to...

Radix sort in C# with source in GitHub Video tutorial of MSD Radix Sort Demonstration and comparison of Radix sort with Bubble sort, Merge sort and Quicksort...

The Sort/Merge utility is a mainframe program to sort records in a file into a specified order, merge pre-sorted files into a sorted file, or copy selected...

input Sorting linked lists (in which case merge sort requires minimal extra space) Parallel sorting; merge sort parallelizes even better than quicksort...

k-way merge sort balanced merge sort balanced multiway merge balanced multiway tree balanced quicksort balanced tree balanced two-way merge sort BANG file...

Sorting, pp. 219–247. "Chapter 46. Improved GPU Sorting". "Sorting network from Batcher's Odd-Even merge: partner calculation". Renat Bekbolatov. Retrieved...

use of in-place merge sort for in-place stable sorting and regular merge sort for stable sorting with additional memory. Partial sorting is implemented...

The Sort Merge Generator was an application developed by Betty Holberton in 1951 for the Univac I and is one of the first examples of using a computer...

comparison sorts include: Quicksort Heapsort Shellsort Merge sort Introsort Insertion sort Selection sort Bubble sort Odd–even sort Cocktail shaker sort Cycle...

basis of efficient algorithms for many problems, such as sorting (e.g., quicksort, merge sort), multiplying large numbers (e.g., the Karatsuba algorithm)...