Rinderknecht, Christian2024-09-042024-09-042013-12-01Teaching Mathematics and Computer Science, Vol. 11 No. 2 (2013) , 195-2101589-7389https://hdl.handle.net/2437/379748Due to technical difficulties, educators teaching merge sort often avoid the analysis of the cost in the general and average cases. Using basic discrete mathematics, elementary real analysis and mathematical induction, we propose a self-contained derivation of bounds αn log_2 n + βn + γ in all cases. Independent of any programming language or pseudo-code, supported by intuitive figures, it is suitable for informatics students interested in the analysis of algorithms. It is also a good exercise in showing that induction allows us to actually discover constants, instead of simply checking them a posteriori.application/pdfdidactics of informaticsanalysis of algorithmscost analysismergingmerge sortenumerative combinatoricsfolyóiratcikkOpen AccessChristian Rinderknechthttps://doi.org/10.5485/TMCS.2013.0340Teaching Mathematics and Computer Science211Teach. Math. Comp. Sci.2676-8364