[Type C]Q5: Write a binary search function as mentioned in the problem statement using the recursion technique.

What is Recursion Function?

A recursive function is a function defined in terms of itself via self-referential expressions.

This means that the function will continue to call itself and repeat its behavior until some condition is met.

Problem: A list namely Adm stores admission numbers of 100 students in it, sorted in ascending order of admission number and looks for it in list Adm using binary search technique. The binary search function should use recursion.

Program code:

Output:

Not Found
3

The above code demonstrates recursion in python.

To view all the lessons in chapter 6: http://computertutor.in/class-12-computer-science/chapter-6/

To view entire class 12 computer science study material: http://computertutor.in/resources/