Binary tree to find the time complexity of O (logN),

if you don't consider the disk I/O read time, M order or fork M B tree to find the time complexity of O (log (M, N)), M as the base,

So the greater the value of M, the better?

Suppose M value for N, then find the degradation time complexity is O (N).

So M has the best take how much?

O great god answer

CodePudding user response:

You like to learn math