K

He's talking about a couple of M, which includes the right couples and not the right ones? The ones who just go for the launch?What is it, in your understanding, "incorrect" couples? There's no splitting the right couples, and there's only the top and the count ribs.Why does he find the middle arithmitical? He says the list is built (1-2 2-3 3-4), etc., to go from the beginning to the end, it takes N-1 times. It's about time evaluation, I remember. The programme implements N merger operations, with each operation taking some time. To be able to say something about the time of the operation as a whole, these values need to be averaged. Then the arithmetic mean.I don't know what he's got to do with the first N couples?
What does he have to do with "the rest of the couples," the wrong couples in? How did he get MN/2?The author sees this sequence of couples at the entrance of the algorithm as an example of bad sequence:First, the N-1 of the - (1.2), (2.3) ... (N-1, N);followed by M-N+1 a pair of species (*, N).Each couple is processed with your algorithm. "Transition" is the irration of one of the cycles. for In the first two lines.For example, for a couple (4,5) of the first block, only three transitions will have to pass 4-3-2-1 (5 still unconnected).For a pair (4, N), the second block will have to pass 4-3-2-1 and then another N-(N-1)-. ... -4-3-2-1, total N+2.