The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Numerical difficulties in pre-university informatics education and competitions
Informatics in education
The IOI is (not) a science olympiad
Informatics in education
Informatics olympiads: challenges in programming and algorithm design
ACSC '08 Proceedings of the thirty-first Australasian conference on Computer science - Volume 74
A master class software engineering for secondary education
ISSEP'06 Proceedings of the 2006 international conference on Informatics in Secondary Schools - Evolution and Perspectives: the Bridge between Using and Understanding Computers
| Hi-index | 0.00 |
We explain the ingredients of the International Olympiad in Informatics (IOI), which is a challenging competition for high-school students focusing on algorithmic problem solving. We treat in detail the MEDIAN task, which the authors created for IOI 2000: Given an odd number of objects, all of distinct strength, develop an efficient algorithm to determine the object of median strength, using as only operation a function that returns the median of three objects. This problem is easy to formulate and understand. It is related to well-studied standard computing problems, but further analysis of this problem leads to interesting algorithms and variations of the heap data structure. We finish by pointing out some open problems related to this task and we invite you to contribute nice competition tasks for future IOIs.