I have seen university students in my German CS classes struggle to implement breadth-first search; I would by highly surprised if an average grade 11 student could write a program to compute the connected components of a maze in less than 45 minutes.