Recursion Versus Iteration with the List as a Data Structure
A reversible sequence of steps from the specification of the algorithm and the mathematical definition of the recurrent solution through the recursive procedure, the tail recursive procedure and finally to the iteration procedure, is shown. The notation for analysing recursive function execution as...
Main Author: | |
---|---|
Format: | Article |
Language: | English |
Published: |
Vilnius University
2007-10-01
|
Series: | Informatics in Education |
Subjects: | |
Online Access: | http://www.mii.lt/informatics_in_education/pdf/INFE107.pdf |
id |
doaj-33d7fc1e57b4470faf96a8e27633de5c |
---|---|
record_format |
Article |
spelling |
doaj-33d7fc1e57b4470faf96a8e27633de5c2021-01-02T02:55:17ZengVilnius UniversityInformatics in Education1648-58312007-10-0162283306Recursion Versus Iteration with the List as a Data StructureIzabella FOLTYNOWICZ0Theoretical Chemistry Department, Faculty of Chemistry, Adam Mickiewicz University ul. Grunwaldzka 6, PL 60-780, Poznan, PolandA reversible sequence of steps from the specification of the algorithm and the mathematical definition of the recurrent solution through the recursive procedure, the tail recursive procedure and finally to the iteration procedure, is shown. The notation for analysing recursive function execution as well as modified flow charts of an algorithm to identify the differences between the iteration and the tail recursion are proposed. All the procedures are written in Logo, so the lists are used as the data structure. Transformation from the recursive procedure to the iterative procedure and vice versa can be shown in such a way in every language in which the recursion is allowed. All examples are one-recursion-call examples and all except one are the functions of discrete mathematics.http://www.mii.lt/informatics_in_education/pdf/INFE107.pdfrecursioniterationtail-end recursionLogolooplist (data structure)discrete mathematics |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Izabella FOLTYNOWICZ |
spellingShingle |
Izabella FOLTYNOWICZ Recursion Versus Iteration with the List as a Data Structure Informatics in Education recursion iteration tail-end recursion Logo loop list (data structure) discrete mathematics |
author_facet |
Izabella FOLTYNOWICZ |
author_sort |
Izabella FOLTYNOWICZ |
title |
Recursion Versus Iteration with the List as a Data Structure |
title_short |
Recursion Versus Iteration with the List as a Data Structure |
title_full |
Recursion Versus Iteration with the List as a Data Structure |
title_fullStr |
Recursion Versus Iteration with the List as a Data Structure |
title_full_unstemmed |
Recursion Versus Iteration with the List as a Data Structure |
title_sort |
recursion versus iteration with the list as a data structure |
publisher |
Vilnius University |
series |
Informatics in Education |
issn |
1648-5831 |
publishDate |
2007-10-01 |
description |
A reversible sequence of steps from the specification of the algorithm and the mathematical definition of the recurrent solution through the recursive procedure, the tail recursive procedure and finally to the iteration procedure, is shown. The notation for analysing recursive function execution as well as modified flow charts of an algorithm to identify the differences between the iteration and the tail recursion are proposed. All the procedures are written in Logo, so the lists are used as the data structure. Transformation from the recursive procedure to the iterative procedure and vice versa can be shown in such a way in every language in which the recursion is allowed. All examples are one-recursion-call examples and all except one are the functions of discrete mathematics. |
topic |
recursion iteration tail-end recursion Logo loop list (data structure) discrete mathematics |
url |
http://www.mii.lt/informatics_in_education/pdf/INFE107.pdf |
work_keys_str_mv |
AT izabellafoltynowicz recursionversusiterationwiththelistasadatastructure |
_version_ |
1724361524585168896 |