Browse wiki
From IOI Wiki
Finding the median under IOI conditions 
Abstract 
We explain the ingredients of the Internat … We explain the ingredients of the International Olympiad in Informatics (IOI), which is
a challenging competition for highschool 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 wellstudied 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. te nice competition tasks for future IOIs. +


Free  1 + 
Has author  Gyula Horváth + , Tom Verhoeff + 
Journal  Informatics in Education + 
Pages  7392 + 
Title  Finding the median under IOI conditions + 
Type  Article + 
Volume  1 + 
Year  2002 + 
Categories  Publications about tasks 
Modification date This property is a special property in this wiki.

27 July 2010 18:15:30 + 
URL This property is a special property in this wiki.

http://www.win.tue.nl/~wstomv/publications/ + 
hide properties that link here 
Finding the median under IOI conditions +  Title 
