 In the best case, the input is already sorted (i.e., is one run), so the natural merge sort need only make one pass through the data.In many practical cases, long natural runs are present, and for that reason natural merge sort is exploited as the key component of Timsort.Example