[Type C]Q1. Write a function using 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: Write a function that takes a number and tests if it is a prime number using recursion technique.

Program code:

Output:

False
False
True

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/