Decimal groups in merge sort (merged sort) using Insert sort

The length is n, divided into n/k decimal group, each length is K

Ask k what value to make the most efficient

Easy to get O (n) =nk+nlg (n/k)

NK is n/k a decimal group to insert sort kxk, get NK

NLG (n/k) is the n/k of the number of clusters need to merge LG (N/K), each time the cost of N

Answer

should be a LGN

O (n) =nk+nlgn-nlgk

If K>LGN, then the first half is greater than the merge sort time complexity, so k maximum is LGN.

Maximum value should be the optimal

Decimal groups in merge sort (merged sort) using Insert sort