mirror of
https://gitlab.com/magicalsoup/Highschool.git
synced 2025-10-03 10:10:53 -04:00
Add new file
This commit is contained in:
@@ -0,0 +1,4 @@
|
||||
## 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.
|
Reference in New Issue
Block a user