Intellectual Olympiad in Informatics - 2026 ongoing

Subject: Informatics
Level: V
Category: student
Quiz questions: in English
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)