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