What does Tim Sort code look in java when combining these two sorting methods? I just need some psudo code to see how it works.

The Tim Sort (named after its creator, Tim Peters) is a hybrid sorting algorithm using both the Merge Sort and the Insertion Sort discussed in the lecture. While the Merge Sort has an over-all superior efficiency, it is found that in practice, the Insertion Sort completes faster with smaller data sets. The Tim Sort works like the normal Merge Sort while the elements in the sub-arrays is above a certain threshold. If the sub-array size is equal to or below the threshold, the Tim Sort will then sort that sub-array via an Insertion Sort. The value of this threshold is usually 32 or 64. For this lab, the threshold is going to be set a bit lower, to 10, since the tests will deal with small data sets in order to provide easier to read visual output.