題組內容
9. Select all statements that are correct about sorting algorithms. (10%)
(e) The lower bound of time complexity for any comparison-based sorting algorithm is \( \Omega (\mathfrak{n}\log \mathfrak{n}) \)
阿摩線上測驗
登入
阿摩線上測驗
登入
9. Select all statements that are correct about sorting algorithms. (10%)
(e) The lower bound of time complexity for any comparison-based sorting algorithm is \( \Omega (\mathfrak{n}\log \mathfrak{n}) \)