算法与编程基础 - 2026 进行中

科目: 算法与编程基础
级别: VIII (I级最简单，XII级最难)
类别: 大学生
试题语言: English
题数: 15
问题示例: A dynamic array doubles its capacity whenever it becomes full. What is the amortized time complexity of appending n elements to an initially empty array? O(log n) per append, O(n) per append, O(n log n) in total, O(n) in total