Introduction to recursion

Abstract: Recursion in computer science is a powerful tool for problem solving, which uses the divide and conquer approach such that the solution depends on solutions to smaller instances of the same problem. In other words, it provides a way to define a problem (or solution) in terms of a simpler version of itself. Programmatically, recursion is implemented by calling a function from within its own definition till a base-case is reached that has a trivial solution. The results from each subproblem are then combined to get the final result.

In this lecture, the basics of recursion will be explained. We will discuss the key characteristics and steps involved in writing a recursive function. The control flow of recursive calls will also be discussed using several examples such as Factorial of n, Fibonacci numbers and Tower of Hanoi.

Bio: Kriti Bhargava received Bachelor's (Hons.) and Master's in Technology (dual degree) in Computer Science from The LNM Institute of Information Technology, India, in 2014, and Ph.D. degree in Computer Science from Waterford Institute of Technology, Ireland, in 2019. Dr. Bhargava is a Research Fellow with the School of Computing, Electronics and Mathematics at Coventry University, UK. Her research interests include edge computing, sensor networks, machine learning and wireless networking. She is particularly interested in the application of concepts of edge computing and machine learning for development of intelligent wireless sensor networks.