Corvinus
Corvinus

Teaching Sorting in ICT

Szlávi, Péter and Törley, Gábor (2009) Teaching Sorting in ICT. Teaching mathematics and computer science, 7 (1). pp. 101-117. DOI 10.5485/TMCS.2009.0208

[img] PDF - Registered users only - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
4MB

Official URL: http://pezsgo.web.elte.hu/dolgok/publikaciok/Peter_Szlavi_Gabor_Torley_Teaching_sorting_in_ICT.pdf


Abstract

This 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.

Item Type:Article
Uncontrolled Keywords:algorithm, Excel, algorithmic thinking, sorting, program efficiency, combinatorics, permutations
Subjects:Education
Computer science
DOI:10.5485/TMCS.2009.0208
ID Code:2181
Deposited By: MTMT SWORD
Deposited On:07 Jan 2016 08:43
Last Modified:07 Jan 2016 08:43

Repository Staff Only: item control page