Teaching sorting in ICT

dc.contributor.authorSzlávi, Péter
dc.contributor.authorTörley, Gábor
dc.date.accessioned2024-09-04T09:46:09Z
dc.date.available2024-09-04T09:46:09Z
dc.date.issued2009-06-01
dc.description.abstractThis article is aimed at considering how an algorithmic problem – more precisely a sorting problem – can be used in an informatics class in primary and secondary education to make students mobilize the largest possible amount of their intellectual skills in the problem solving process. We will be outlining a method which essentially forces students to utilize their mathematical knowledge besides algorithmization in order to provide an efficient solution. What is more, they are expected to use efficiently a tool that has so far not been associated with creative thinking. Sorting is meant to be just an example, through which our thoughts can easily be demonstrated, but – of course the method of education outlined can be linked to several other algorithmic problems, as well.en
dc.formatapplication/pdf
dc.identifier.citationTeaching Mathematics and Computer Science, Vol. 7 No. 1 (2009) , 101-117
dc.identifier.doihttps://doi.org/10.5485/TMCS.2009.0208
dc.identifier.eissn2676-8364
dc.identifier.issn1589-7389
dc.identifier.issue1
dc.identifier.jatitleTeach. Math. Comp. Sci.
dc.identifier.jtitleTeaching Mathematics and Computer Science
dc.identifier.urihttps://hdl.handle.net/2437/379660
dc.identifier.volume7
dc.languageen
dc.relationhttps://ojs.lib.unideb.hu/tmcs/article/view/14850
dc.rights.accessOpen Access
dc.rights.ownerPéter Szlávi and Gábor Törley
dc.subjectalgorithmen
dc.subjectExcelen
dc.subjectalgorithmic thinkingen
dc.subjectsortingen
dc.subjectprogram efficiencyen
dc.subjectcombinatoricsen
dc.subjectpermutationsen
dc.titleTeaching sorting in ICTen
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:
963.9 KB
Formátum:
Adobe Portable Document Format