Merge sort is a recursive sorting algorithm based on a “divide and conquer” approach.
- v1.0: Initial version
- v1.1: Use the proper title MERGE SÖRT instead of MERGESORT in the recursion
- v1.2: Update the IDEA logo
Initially published 2018-01-09.
We have a couple of remaining mugs, shirts and posters left. If you're interested, get in touch!
Permanent link: idea-instructions.com/merge-sort/
Download: PDF, PNG, SVG (notes) – License: CC by-nc-sa 4.0
Merge sort is a recursive sorting algorithm based on a “divide and conquer” approach.
Initially published 2018-01-09.