Answers ( 1 )

  1. 2016-12-15 14:12

    It will be O(n logn) because O(n logn + logn) = O(n logn) So yes, you sum it, but in this case it doesn't matter

    If the function f can be written as a finite sum of other functions, then the fastest growing one determines the order of f(n) Wikipedia

◀ Go back