mirror of
https://gitlab.com/magicalsoup/Highschool.git
synced 2025-01-24 00:21:45 -05:00
4 lines
346 B
Markdown
4 lines
346 B
Markdown
|
## Introduction
|
||
|
|
Merge sort is a comparison type sort that has an effective use of recursion and the divide and conquer algorithm.
|
||
|
|
Merge sort sorts in O(N log N) time and uses O(N log N) space.We will explore the pros and cons of this sort,
|
||
|
|
the proofs on its time and space complexity and the implementation and algorithm of this sorting method.
|