The problem we chose for project 3 is to calculate higher powers.
Objective: Calculate high power in the shortest time possible using iterative algorithm and / or recursive
What is recursion: A recursive algorithm is one that makes a call to a subroutine inherent to it, making The steps or actions within it, can be repeated successively until one or several variables can be operated by turning it into a known fact. Subroutines properties allow us to expand its use to a myriad of programs, even the most complex.
A recursive algorithm can be used when needed to perform the same actions many times, although not more efficient than the iterative algorithm, it saves time to implement it.
As we work as group: The organization was not the best in our team, but with some effort towards the end, we could finish everything planned. I take an important role in this, because I was seeing more and more frequent as he was leading the team as assigned or corrected some work activities.
That was my contribution to the work: Make both algorithms (iterative and recursive), the 2 pseudocode from the place a code made by my partner in C, I corrected previously. I also graphs the asymptotic analysis with the program "gnuplot", correcting the introduction, conclusion and recommendations.
also computational complexity, the analysis step by step iterative algorithm just like my friend, I got the PDF to the Internet for safety.
That could improve in the future: The creation of pseudo and how individual organizations and with my team.
Links to blogs:
Dora Nelly González Martínez
Angel Joel Escamilla
Montemayor Jorge Martinez Chavez
Links
PDF document:
Show
Download
0 comments:
Post a Comment