Implement TimSort using java

TimSort

• 1.) Using the parameter param to split the dataset into portions. Then, sort each of the portions using Insertion sort.

  • Note: not physically splitting the arraylist into separate arraylists.

  • Rather, use the indices to sort each portion of the arraylist

• 2.) Merging sorted subarrays

  • Merge the sorted subarrays

  • In each iteration over the array, double the size of the merged subset

Note 1: If param >= length of array, default to insertion sort.