didactic analysis of merge sort

A tétel rövid nézete
dc.contributor.authorRinderknecht, Christian
dc.date.accessioned2024-09-04T09:46:56Z
dc.date.available2024-09-04T09:46:56Z
dc.date.issued2013-12-01
dc.description.abstractDue 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.en
dc.formatapplication/pdf
dc.identifier.citationTeaching Mathematics and Computer Science, Vol. 11 No. 2 (2013) , 195-210
dc.identifier.doihttps://doi.org/10.5485/TMCS.2013.0340
dc.identifier.eissn2676-8364
dc.identifier.issn1589-7389
dc.identifier.issue2
dc.identifier.jatitleTeach. Math. Comp. Sci.
dc.identifier.jtitleTeaching Mathematics and Computer Science
dc.identifier.urihttps://hdl.handle.net/2437/379748
dc.identifier.volume11
dc.languageen
dc.relationhttps://ojs.lib.unideb.hu/tmcs/article/view/14938
dc.rights.accessOpen Access
dc.rights.ownerChristian Rinderknecht
dc.subjectdidactics of informaticsen
dc.subjectanalysis of algorithmsen
dc.subjectcost analysisen
dc.subjectmergingen
dc.subjectmerge sorten
dc.subjectenumerative combinatoricsen
dc.titledidactic analysis of merge sorten
dc.typefolyóiratcikkhu
dc.typearticleen
Fájlok
Eredeti köteg (ORIGINAL bundle)
Megjelenítve 1 - 1 (Összesen 1)
Nincs kép
Név:
PDF
Méret:
259.29 KB
Formátum:
Adobe Portable Document Format
Letöltés
Gyűjtemények
Teaching Mathematics and Computer Science (DE-journals)