Need some help with these methods.

/**

* The Tim Sort is a hybrid of Merge Sort and Insertion Sort.

* Since Insertion Sort is faster than Merge Sort for smaller data sets,

* the Tim sort will use Merge Sort when the data is greater than the set

* TIM_SORT_LIMIT (which is set to 10). At or below the limit Insertion sort will be used.

* This method is the public entry point to the algorithm.

* @param data- The data set to be ordered.

*/

public static void timSort(int[] data)

{

}

/**

* Recursive helper method of Tim Sort. Works as normal

* Merge Sort except before recursive calls are made it will

* check find the amount of elements in the current sub-array

* to be sorted. If this value is less than or equal to

* TIM_SORT_LIMIT it will instead call upon insertion sort.

* @param data - The data in which the sub-array is located

* @param low - Lower index of the sub-array.

* @param high - Upper index of the sub-array.

*/

private static void timSort(int[] data, int low, int high)

{

}