Interactive Approach to Learning of Sorting Algorithms

被引:2
作者
Mavrevski, Radoslav [1 ]
Traykov, Metodi [1 ]
Trenchev, Ivan [1 ,2 ]
机构
[1] South West Univ Neofit Rilski, Univ Ctr Adv Bioinformat Res, 66 Ivan Mihaylov Str, Blagoevgrad, Bulgaria
[2] Univ Lib Studies & Informat Technol, Sofia, Bulgaria
关键词
Sorting algorithms; programing; NET framework;
D O I
10.3991/ijoe.v15i08.10530
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Today we live in a society of high technologies, advanced information and communication systems in every field, including education. So, in modem education, teachers make full use of the possibilities of modem Information and Communication Technologies (ICT). In this case, the attitude of the teachers towards the use of computers, to achieve the educational goals, is very important. To have the technologies sustained and significant effect, students in secondary and higher schools need to understand how to use them. The goal of this article is to help of students in secondary and higher schools to acquire enough practical programming skills and to learn the sorting algorithms, i.e. the article considers basic sorting algorithms. We developed and describe here software with name "Visual sorting" that shows visual, the execution of the basic sorting algorithms: Bubble sort; Selection sort; Insertion sort; Merge sort. Also, our software provides inter-active tracking of the performance (step by step) of different sorting algorithms.
引用
收藏
页码:120 / 134
页数:15
相关论文
共 33 条
[11]   A Generic Approach to the Verification of the Permutation Property of Sequential and Parallel Swap-Based Sorting Algorithms [J].
Safari, Mohsen ;
Huisman, Marieke .
INTEGRATED FORMAL METHODS, IFM 2020, 2020, 12546 :257-275
[12]   Teaching sorting and searching algorithms through simulation-based learning objects in an introductory programming course [J].
Tuparov, Georgi ;
Tuparova, Daniela ;
Jordanov, Vladimir .
5TH WORLD CONFERENCE ON EDUCATIONAL SCIENCES, 2014, 116 :2962-2966
[13]   Sweep maps: A continuous family of sorting algorithms [J].
Armstrong, Drew ;
Loehr, Nicholas A. ;
Warrington, Gregory S. .
ADVANCES IN MATHEMATICS, 2015, 284 :159-185
[14]   Synthesis of sorting algorithms using multisets in Theorema [J].
Dramnesc, Isabela ;
Jebelean, Tudor .
JOURNAL OF LOGICAL AND ALGEBRAIC METHODS IN PROGRAMMING, 2021, 119
[15]   Robustness versus Performance in Sorting and Tournament Algorithms [J].
Elmenreich, Wilfried ;
Ibounig, Tobias ;
Fehervari, Istvan .
ACTA POLYTECHNICA HUNGARICA, 2009, 6 (05) :7-18
[16]   Sorting Algorithms as Special Cases of a Priority Queue Sort [J].
Bell, Tim ;
Aspvall, Bengt .
SIGCSE 11: PROCEEDINGS OF THE 42ND ACM TECHNICAL SYMPOSIUM ON COMPUTER SCIENCE EDUCATION, 2011, :123-128
[17]   Energy-Efficiency Comparison of Common Sorting Algorithms [J].
Schmitt, Norbert ;
Kamthania, Supriya ;
Rawtani, Nishant ;
Mendoza, Luis ;
Lange, Klaus-Dieter ;
Kounev, Samuel .
29TH INTERNATIONAL SYMPOSIUM ON THE MODELING, ANALYSIS, AND SIMULATION OF COMPUTER AND TELECOMMUNICATION SYSTEMS (MASCOTS 2021), 2021, :17-24
[18]   Minimum average case time complexity for sorting algorithms [J].
Anurag Dutta ;
Manan Roy Choudhury ;
Rakesh K. Sharma .
Iran Journal of Computer Science, 2023, 6 (4) :445-451
[19]   Impact of Programming Languages on Energy Consumption for Sorting Algorithms [J].
Chandra, Tej Bahadur ;
Verma, Pushpak ;
Dwivedi, Anuj Kumar .
SOFTWARE ENGINEERING (CSI 2015), 2019, 731 :93-101
[20]   Examining the Energy Impact of Sorting Algorithms on Android: An Empirical Study [J].
Schuler, Andreas ;
Anderst-Kotsis, Gabriele .
PROCEEDINGS OF THE 16TH EAI INTERNATIONAL CONFERENCE ON MOBILE AND UBIQUITOUS SYSTEMS: COMPUTING, NETWORKING AND SERVICES (MOBIQUITOUS'19), 2019, :404-413