Live briefing
Everything about Merge algorithm
Algorithm that combines multiple sorted lists into one
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 the inputs lists in sorted order. These algorithms are used as subroutines in various sorting algorithms, most famously merge sort. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Merge algorithmA 5-minute orientation
- Skim a recent paper: A split–merge clustering algorithm based on the k-nearest neighbor graphInfluential work since 2022
- Pick up a classic book: An introduction to computer scienceThe most-reprinted book on the subject
- Read the landmark paper: Algorithm and Hardware for a Merge Sort Using Multiple ProcessorsCited 45 times
- Go sideways: Merge sortA closely related topic
- Go sideways: K-way merge algorithmA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Algorithm and Hardware for a Merge Sort Using Multiple Processors
Divide well to merge better: A novel clustering algorithm
Iterative split-and-merge algorithm for vector quantization codebook generation
A parallel sort merge join algorithm for managing data skew
Parallelization of Modified Merge Sort Algorithm
Merge Nondominated Sorting Algorithm for Many-Objective Optimization
A projection-based split-and-merge clustering algorithm
An adaptive over-split and merge algorithm for page segmentation
🆕 Influential since 2022
A split–merge clustering algorithm based on the k-nearest neighbor graph
An Offline-Merge-Online Robot Teaching Method Based on Natural Human-Robot Interaction and Visual-Aid Algorithm
Road Boundary Detection Using Multi-channel LiDAR Based on Disassemble-reassemble-merge Algorithm for Autonomous Driving
Parallel Multi-Deque Partition Dual-Deque Merge sorting algorithm using OpenMP
Positive Anchor Area Merge Algorithm: A Knowledge Distillation Algorithm for Fruit Detection Tasks Based on Yolov8
📚 Books worth reading
An introduction to computer scienceJean-Paul Tremblay, Richard B. Bunt · 1979
Data structures and algorithm analysis in CMark Allen Weiss · 1993
Big data analytics for beginnersFaraz Rabbani · 2014
Data structures & algorithm analysis in JavaMark Allen Weiss · 1999
Data structures and algorithms in JavaAdam Drozdek · 2001
Computer algorithmsEllis Horowitz · 1997
Fundamentals of data structures in CEllis Horowitz · 1993
Data structures & algorithms in JavaRobert Lafore · 2003
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Merge sort Merge sort (also commonly spelled as mergesort or merge-sort) is an efficient, general-purpose, comparison-based sorting algorithm. Most implementations…
- K-way merge algorithm In computer science, k-way merge algorithms or multiway merges are a specific type of sequence merge algorithms that specialize in taking in k sorted lists…
- 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…
- Quicksort Quicksort is an efficient, general-purpose sorting algorithm. Quicksort was developed by British computer scientist Tony Hoare in 1959 and published in…
- 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…
- Heapsort In computer science, heapsort is an efficient, comparison-based sorting algorithm that reorganizes an input array into a heap (a data structure where each…
- Selection sort In computer science, selection sort is an in-place comparison sorting algorithm. It has a O(n2) time complexity, which makes it inefficient on large lists…
- Radix sort In computer science, radix sort is a non-comparative sorting algorithm. It avoids comparison by creating and distributing elements into buckets according…