Intellectual Olympiad in Informatics - 2026 ongoing
1000 ₸
Subject: Informatics Level: IX (I is easiest, XII is hardest)
Category: student
Question language: English
Questions: 15
Example question: 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))