The topic of sorting algorithms is a pleasant subject of informatics education. Not only is it so because the notion of sorting is well known from our everyday life, but also because as an algorithm task, whether we expect naive or practical solutions, it is easy to define and demonstrate. In my paper I will present some of the possible methods and goals of teaching sorting algorithms in the primary and the secondary school context. Some of the applicable demonstration and collaborative methods will be listed and illustrated with examples available on the internet. Next to defining the teaching goals offered by the specific methods, I will also make suggestions which methods are optimal for a given teaching phase.