Merge Sort
Term side of the Card
Topic: Sorting Algorithms
Unit title: Merge Sort
Categories: Algorithm
Explanation side of the Card
Explanation: The divide-and-conquer sorting algorithm that splits a list into smaller sublists, sorts them and merges them. Known for stable sorting with O(n log n) complexity.