Untitled

A constructor can overload to overloading functions in a similar way.

Constructors overloaded have the same name (class name) but a varying number of arguments. A specific constructor is named according to the number and form of arguments transferred. Since multiple constructors are present, the argument should also be passed on to the constructor when constructing an entity. Constructors could also be overloaded as with other member functions. If you have both default and parameterized constructors specified in your class, you will have overloaded constructors, one without parameter and one with parameter. In a class, you can have any number of Constructors varying in the parameter list.

Here is a Exapmle of Constructor Overloading in C++ class Student {    public:    int rollno;    string name;    // first constructor created    Student(int x)    {        rollno = x;        name = "None";    }    // second constructor created    Student(int x, string str)    {        rollno = x;        name = str;    } };

int main() {    // student M initialized with roll no 20 and name None    Student M(10);

   // student N initialized with roll no 21 and name Nikhil    Student N(11, "Nikhil"); }

Destructors in C++ Destructor is a special class feature that destructs the object as soon as the object's scope ends. When the object passes out of scope, the destructor is called automatically by the compiler.

This has the same name as the class before it, with a tilde (~) symbol.

Syntax: class N {    public:        ~N(); };

In the above syntax, ~N() is the destructor of class N.

Note: Destructors take no arguments and don't have the type of return.

When is call a Destructor? When the object goes out of sight, a destructor gets automatically named. We know that when a class object is generated, a non-parameterized constructor gets called automatically. Exactly the opposite, since a destroyer is always non-parameterized as well, it is called when the object leaves the scope and destroys the object. Destructors are used to free up the memory that an entity acquires so the memory can be used for another purpose.

Let's take a Exapmle of Destructor in C++ class N {    // constructor initialize    N()    {        cout << "Constructor called";    }

   // destructor initialize    ~N()    {        cout << "Destructor called";    } };

int main() {    N obj1;   // Constructor Called    int x = 1    if(x)    {        N obj2;  // Constructor Called    } }

Recursion is the mechanism of repeating objects in a similar manner to themselves. When a program allows you to call a function inside the same function in programming languages, that function is called a recursive call.Recursion can result in an intuitive, very simple, elegant code to follow. It may also require the use of a very large amount of memory if the recursion is too long.

A function which itself calls is known as a recursive function. And, the strategy is called recursion in c. 

Recursion can not be extended to all of the problem, but for the tasks that can be described in terms of similar subtasks it is more useful. For example, recursion can be applied to problem sorting, searching, and traversing.

C program helps you to do such function calling inside a specific function, i.e., a recursion. However when introducing this definition of recursion, you must be careful to specify an exit or terminate condition from this recursive function, or else it will lead to an infinite loop, so make sure the condition is set within your program.

Example Syntax of Recursive Function in C void rec_prog(void) {  rec_prog(); /* function calls itself */}

int main(void) {  rec_prog();  return 0; } Note: We need to describe correct exit condition in a recursive function to prevent indefinitely recursive calling.

Example of recursive function in C programming : C program that uses iteration to identify the fact of the first 6 natural numbers

#include <stdio.h> #include<conio.h>

long int fact( int n ) {     if ( n <= 1 )        return 1;     else      //here is recursive step        return ( n * fact (n-1) ); } int main () {     int i;     for ( i = 1; i <=6; i++ )        printf("%d! = %d\n",i, fact(i) );     return 0; }

Output: 1! = 1 2! = 2 3! = 6 4! = 24 5! = 120 6! = 720

Fibonacci series #include<stdio.h> #include<conio.h>

int main()     {     int n1=0,n2=1,n3,i,number;     printf("Enter the number of elements:");     scanf("%d",&number);     printf("\n%d %d",n1,n2);//printing 0 and 1     for(i=2;i<number;++i)//loop starts from 2 because 0 and 1 are already printed     {      n3=n1+n2;      printf(" %d",n3);      n1=n2;      n2=n3;     }    return 0;   }

Output: Enter the number of elements: 5 01123

Fibonacci series using Recursion in C programming #include<stdio.h> #include<conio.h>

void printFibonacci(int n){        static int n1=0,n2=1,n3;        if(n>0){             n3 = n1 + n2;             n1 = n2;             n2 = n3;             printf("%d ",n3);             printFibonacci(n-1);        }     }     int main(){        int n;        printf("Enter the number of elements: ");        scanf("%d",&n);        printf("Fibonacci Series: ");        printf("%d %d ",0,1);        printFibonacci(n-2);//n-2 because 2 numbers are already printed      return 0;   } Output: Enter the number of elements: 4 01123

Constructor Overloading in C++, The process in which the same name is shared by two or more functions is referred to as function overloading. Similarly, when more than one constructor function is shared in a defined class, we will call it as constructor overloading.

Recursion in C Recursion is the mechanism of repeating objects in a similar manner to themselves. When a program allows you to call a function inside the same function in programming languages, that function is called a recursive call.Recursion can result in an intuitive, very simple, elegant code to follow. It may also require the use of a very large amount of memory if the recursion is too long.