1. Speed: O (N ∙ log₂ (N)² ∙ X) where N is number of elements for sorting and X is comparing speed
   
2. Memory: O (2 ∙ N) where N is number of elements for sorting
   
   

##TODO:

1. Write C Implementation
   
2. Write Java Implamentation
   
3. Fix JavaScript Implementation
   
4. Write Python Implementation