计算机科学 - 2026 进行中

1000 ₸
科目: 计算机科学
级别: IX
类别: 大学生
测试题目: 英语
问题示例: In a disjoint-set union structure using both path compression and union by rank, what is the amortized time complexity of a single operation? O(1), O(log n), O(n log n), O(α(n))