Skip to content

OH Questions

Jump to bottom
Liming edited this page Jan 24, 2025 · 6 revisions

CS590 2025/01/23

  1. 截屏2025-01-24 16 06 30

  2. In question: we need to prove n is o(n logn). Can we use limites comparison to answer this question?

  3. Group together (for example, by underlining) those functions that are big-Theta of one another.(asymptotically equal) Expectation of the grouping? Should we group them by their asymptotic growth rate, i.e. O(n), O(logn), O(nlogn), etc.

Frontend

Clone this wiki locally