Home/ Questions/Q 9305219
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Asked: 2026-06-18T23:52:47+00:00

We are going over the master theorem in my algorithms class, and for one

  • 0

We are going over the master theorem in my algorithms class, and for one problem, I’m trying to compare nlogn vs 1 to figure out which case of the MT it falls under. But I’m having a hard timing figuring out which is bigger.

Edit: This is for solving a recurrence problem. The equation is T(n) = 2T(n/4) + N*LogN. Just threw this in incase it helps.

Share

Leave an answer

You must login to add an answer.

Need An Account,

1 Answer

  1. Editorial Team

    Think about it this way:

    • O(N*LogN) will increase with N in such a way that for any X, no matter how large, you can find a value of N such that N*LogN is greater than X.
    • O(1) will stay the same, no matter what N is.

    This means that O(1) is asymptotically better, i.e. for some (perhaps very high) value of N the O(N*LogN) will become slower.

    • 0