Prepared a skeleton for timsort.
Added a variant of insertion-sort that uses a comparatr instead of the predicate functions gt and lt.
A very unexpected result is coming out: it is not slower at all!!!!
A new approach on standardizing everything using comparatars is then posible without a compromise on performances?