Merge sort

Quote

“The art of programming is the art of organizing complexity.” — Edsger W. Dijkstra

Case	Time complexity	Space complexity
Best	\(\color{black} \fcolorbox{darkorange}{sandybrown} {Ω(n . log(n))}\)
Average	\(\color{black} \fcolorbox{darkorange}{sandybrown} {Θ(n . log(n))}\)
Worst	\(\color{black} \fcolorbox{darkorange}{sandybrown} {O(n . log(n))}\)	\(\color{black} \fcolorbox{gold}{yellow} {O(n)}\)

Efficiently sorts large data sets with divide and conquer.

Note

A work in progress, check back later for more content.