Analysis of Recursive Teaching of Computational Thinking

DOI

10.2991/assehr.k.201023.129How to use a DOI?

Keywords

computational thinking, recursion, divide and conquer, backtracking

Abstract

The idea of recursion runs through the algorithm design itself and is a very important part of the program design. Learning algorithms is a good way to cultivate computing power. This paper analyzes computational thinking, the concept of recursion, algorithm thinking methods and steps based on recursive problems, and combines the procedural nature of algorithm design and computational thinking problem solving from five aspects, so as to analyze the thousands of factors between algorithm design and computational thinking. The inextricable connection enables students to strengthen their computational thinking skills while studying algorithm design courses; they can be more comfortable in solving programming problems.

Copyright

© 2020, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Ren Xiaokang
AU  - Yang Deyi
PY  - 2020
DA  - 2020/11/06
TI  - Analysis of Recursive Teaching of Computational Thinking
BT  - Proceedings of the 2020 5th International Conference on Modern Management and Education Technology (MMET 2020)
PB  - Atlantis Press
SP  - 661
EP  - 665
SN  - 2352-5398
UR  - https://doi.org/10.2991/assehr.k.201023.129
DO  - 10.2991/assehr.k.201023.129
ID  - Xiaokang2020
ER  -