Open marcusskjold opened 1 day ago
In the algorithm of Task 5, create new runs of length c by taking the c next elements and sort them using InsertionSort.
If there are less than c elements remaining in the array, turn them into one new run using InsertionSort.
In the algorithm of Task 5, create new runs of length c by taking the c next elements and sort them using InsertionSort.
If there are less than c elements remaining in the array, turn them into one new run using InsertionSort.