eggy/highschool
1
0
Fork 0
mirror of https://gitlab.com/magicalsoup/Highschool.git synced 2025-01-23 16:11:46 -05:00
Code Issues Releases Wiki Activity
3ceca1853b
highschool/Grade 10/Computer Science/ICS4U1/Sorting Methods/Merge Sort.md
James Su 3ceca1853b Add new file
2019-10-25 15:49:39 +00:00

346 B
Raw Blame History

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.