计算机科学 - 2026 进行中

科目: 计算机科学
级别: V
类别: 大学生
测试题目: 英语
问题示例: An algorithm performs a binary search at each level of a balanced binary recursion tree, and there are logarithmically many levels. What is its asymptotic time complexity in terms of n? O(n), O(log n), O((log n)²), O(n log n)