Add Timsort

[camilne]

Issue title

Add Timsort

Issue description

Timsort is an adaptive sorting algorithm that takes advantage of existing runs in a sequence to sort the data.

Details:
Best-case Time: O(n)
Average-case Time: O(n log n)
Worst-case Time: O(n log n)
Space: O(n)

Checklist

• Check for existing issue
• Check for existing pull request