Recursion in an algorithm is a kind of iterative processing. A recursive function is a function that calls itself in an algorithm or computer program. Recursion is sometimes preferred to classical loops especially in sorting algorithms for example, because the execution of the program is faster, and the source code is often shorter so more readable. In this lesson we will implement the recursive function seen in the algorithm in a Python program.
Watch video Algorithms (13/14) - Recursion (recursive functions) online without registration, duration hours minute second in high quality. This video was added by user Mohamed Chiny 29 January 2021, don't forget to share it with your friends and acquaintances, it has been viewed on our site 149,033 once and liked it 1.8 thousand people.