Find centralized, trusted content and collaborate around the technologies you use most.
Teams
Q&A for work
Connect and share knowledge within a single location that is structured and easy to search.
算法的时间复杂度由 n^2/log(n) 给出。大O符号是什么？只是 n^2 还是我们保留日志？
当增长n^2 / (n^2/log(n))时会趋于无穷大，所以， （小哦）。因此，不等价于。nn^2/log(n) = o(n^2)n^2/log(n)n^2
n^2 / (n^2/log(n))
n
n^2/log(n) = o(n^2)
n^2/log(n)
n^2