Refactor Merge Sort Algorithm

[waynewbishop]

We currently have a merge sort algorithm in our repo, but I feel this could be refactored into a more efficient / simplified model. The resulting code would be published in essay format.

[kaandedeoglu]

Here's a recursive version I did. I'm not sure if it's more efficient though

https://gist.github.com/kaandedeoglu/14a11230edafe8dacf67

[Dimentar]

Merge Method -> Original from "CLRS", Recursive.
High Performance, running time for 10.000 items is 0.25 sec around
Used like array extension:

 someArray.mergeSort()

https://gist.github.com/Dimentar/adcebabe147fede490e5

[Dimentar]

Added another version not so performed like first, but less code.
However the running time for 10.000 items is 0.6 sec around

https://gist.github.com/Dimentar/2ee38227cbdd82d4c065

[joanmolinas]

Hey guys, for compare the time between two functions and know what is more efficient, I did a library for this. https://github.com/ulidev/Zilean

I hope to help.