Not this work, mainly is I don't know this recursive relations of 2 t (n/2) how to, and the reasoning process has no, write directly, didn't find out

CodePudding user response:

Because of recursive ah, if the input is n,
Will perform two mergesort (n/2) and a merge

CodePudding user response:

reference 1/f, the truth is right or wrong response:

because recursive ah, if the input is n,
Will perform two mergesort (n/2) and a merge

Why does mergesort (a, n + 1, j) is n/2

CodePudding user response:

You are wrong?
Is
Mergesort (a, m + 1, j)
M=n/2

CodePudding user response:

reference 3 floor truth is right or wrong response:

are you wrong?
Is
Mergesort (a, m + 1, j)
M=n/2

Ok, thank you, I understand, is a novice, haven't learned merge sort, understand this time