Solving equation with $n\log n$ Given a computer that takes 1 microsecond for an operation, I'm trying to find the amount of operations this computer can perform in one second, given an algorithm with complexity $O(n\log n)$. I've tried to solve it by the following ways but always get stuck. Note that one second equals $10^6$ microseconds.



I've found this post where it's stated that "there is no simple way" to solve that but I still want to ask here if there is any different approach to the question from a "computer science perspective".
No way to say. $T(n) = O(n \log n)$ means there exist constants $c &gt; 0, N_0$ so that for all $n \ge N_0$ it is $T(n) \le c n \log n$. They are anything, i.e., it might be valid only for ridiculously large $n$ (large $N_0$), or even for small $N_0$, like $N_0 = 10$, the constant $c$ could be such that all you know is that $T(100) \le \text{one milisecond}$ or $T(100) \le \text{one week}$.