Python Exercises: Recursion and Running Times

Expand your study of algorithms to cover recursion, one of the most fascinating ideas in computer science. Apply recursion to form a pair of sorting algorithms. Then see how another approach, iteration, excels at tasks that take too long with recursion, such as calculating the Fibonacci sequence. This lecture, presented by John Keyser, is from How to Program: Computer Science Concepts and Python Exercises. Programming is an eminently learnable skill that gives you unrivaled problem-solving power you can apply in all areas of life. It’s also a fun, creative activity that provides insight into how we control the devices that influence virtually every aspect of our lives. The 24 engaging and information-rich lessons of How to Program teach you one of the world’s most accessible and powerful computer languages, Python.