Complexitor: An Educational Tool for Learning Algorithm Time Complexity in Practical Manner

Elvina, Elvina and Karnalim, Oscar (2017) Complexitor: An Educational Tool for Learning Algorithm Time Complexity in Practical Manner. Comtech: Computer, Mathematics and Engineering Applications, 8 (1). pp. 21-27. ISSN 2087-1244

[img] Text
A5 2017-03 COMTECH ISSN-2087-1244.pdf - Published Version
Download (642Kb)

Abstract

Based on the informal survey, learning algorithm time complexity in a theoretical manner can be rather difficult to understand. Therefore, this research proposed Complexitor, an educational tool for learning algorithm time complexity in a practical manner. Students could learn how to determine algorithm time complexity through the actual execution of algorithm implementation. They were only required to provide algorithm implementation (i.e. source code written on a particular programming language) and test cases to learn time complexity. After input was given, Complexitor generated execution sequence based on test cases and determine its time complexity through Pearson correlation. An algorithm time complexity with the highest correlation value toward execution sequence was assigned as its result. Based on the evaluation, it can be concluded this mechanism is quite effective for determining time complexity as long as the distribution of given input set is balanced.

Item Type: Article
Uncontrolled Keywords: Complexitor, educational tool, learning algorithm, time complexity
Subjects: T Technology > T Technology (General)
Depositing User: Perpustakaan Maranatha
Date Deposited: 09 Apr 2018 01:15
Last Modified: 09 Apr 2018 01:15
URI: http://repository.maranatha.edu/id/eprint/24318

Actions (login required)

View Item View Item
MCUrepository is powered by EPrints 3 which is developed by the School of Electronics and Computer Science at the University of Southampton. More information and software credits.