Live briefing
Everything about Merge sort
Divide and conquer sorting algorithm
Merge sort is an efficient, general-purpose, comparison-based sorting algorithm. Most implementations of merge sort are stable, which means that the relative order of equal elements is the same between the input and output. Merge sort is a divide-and-conquer algorithm that was invented by John von Neumann in 1945. A detailed description and analysis of bottom-up merge sort appeared in a report by Goldstine and von Neumann as early as 1948. Wikipedia →
🧠Start here: a 6-step reading path
- Read the overview: Merge sortA 5-minute orientation
- Skim a recent paper: Information Architecture: Using Best Merge Method, Category Validity, and Multidimensional Scaling for Open Card Sort Data AnalysisInfluential work since 2022
- Pick up a classic book: ProStar training guideThe most-reprinted book on the subject
- Read the landmark paper: Parallel Merge SortCited 553 times
- Go sideways: QuicksortA closely related topic
- Go sideways: SamplesortA closely related topic
đź“– Definitions
Noun Synonym of mergesort.
🏆 Landmark papers (most cited)
Parallel Merge Sort
Algorithm and Hardware for a Merge Sort Using Multiple Processors
A parallel sort merge join algorithm for managing data skew
Parallelization of Modified Merge Sort Algorithm
The Sort-Merge-Shrink join
Parallel Merge Sort with Load Balancing
Comparative Analysis between Selection Sort and Merge Sort Algorithms
Why sort-merge gives the best implementation of the natural join
🆕 Influential since 2022
Information Architecture: Using Best Merge Method, Category Validity, and Multidimensional Scaling for Open Card Sort Data Analysis
DNA Merge-Sort: A Family of Nested Varshamov-Tenengolts Reassembly Codes for Out-of-Order Media
Empirical Analysis Measuring the Performance of Multi-threading in Parallel Merge Sort
Halstead’s Complexity Measure of a Merge sort and Modified Merge sort Algorithms
Wall-L merge sort: A tunable and adaptive sorting algorithm for diverse computing environments
đź“š Books worth reading
- 📕ProStar training guideJane Davis · 1983
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
đź”— Related topics
- Quicksort Quicksort is an efficient, general-purpose sorting algorithm. Quicksort was developed by British computer scientist Tony Hoare in 1959 and published in…
- Samplesort Samplesort is a sorting algorithm that is a divide and conquer algorithm often used in parallel processing systems. Conventional divide and conquer sorting…
- Insertion sort Insertion sort is a simple sorting algorithm that builds the final sorted array (or list) one item at a time by comparisons. It is much less efficient…
- Merge algorithm Merge algorithms are a family of algorithms that take multiple sorted lists as input and produce a single list as output, containing all the elements of…
- Bucket sort Bucket sort, or bin sort, is a sorting algorithm that works by distributing the elements of an array into a number of buckets. Each bucket is then sorted…
- Sorting algorithm In computer science, a sorting algorithm is an algorithm that puts elements of a list into an order. The most frequently used orders are numerical order…
- Spreadsort Spreadsort is a sorting algorithm invented by Steven J. Ross in 2002. It combines concepts from distribution-based sorts, such as radix sort and bucket…
- Partial sorting In computer science, partial sorting is a relaxed variant of the sorting problem. Total sorting is the problem of returning a list of items such that its…