- Speed: O (N ∙ log₂ (N)² ∙ X) where N is number of elements for sorting and X is comparing speed
- Memory: O (2 ∙ N) where N is number of elements for sorting
##TODO:
- Write C Implementation
- Write Java Implamentation
- Fix JavaScript Implementation
- Write Python Implementation