Linear Search using recursion

Write a C++ Program to implement Linear Search using recursion. Here’s simple C++ Program to implement Linear Search using recursion in C++ Programming Language.

What are Functions ?

Function is a block of statements that performs some operations. All C++ programs have at least one function – function called “main()”. This function is entry-point of your program.

A function declaration tells the compiler about a function’s name, return type, and parameters. A function definition provides the actual body of the function.

Defining a Function : :

The general form of a C++ function definition is as follows:

return_type Function_Name( list of parameters )
{
//function’s body
}

• return_type : suggests what the function will return. It can be void, int, char, some pointer or even a class object.
• Function_Name : is the name of the function, using the function name it is called.
• Parameters : are variables to hold values of arguments passed while function is called. A function may or may not contain parameter list.
• Function body : is he part where the code statements are written.

Below is the source code for C++ Program to implement Linear Search using recursion which is successfully compiled and run on Windows System to produce desired output as shown below :

SOURCE CODE : :

/*  C++ Program to implement Linear Search using recursion */

#include<iostream>
using namespace std;

int recursiveLinearSearch(int array[],int key,int size)
{
        size=size-1;
        if(size <0)
    {
                return -1;
        }
        else if(array[size]==key)
        {
                return 1;
        }
        else
        {
                return recursiveLinearSearch(array,key,size);
        }
}

int main()
{
        int size;
        cout<<"\nEnter Size Of Array :: ";
        cin>>size;
        int array[size], key,i;

        for (int j=0;j<size;j++)
    {
                cout<<"\nEnter [ "<<j<<" ] Element :: ";
                cin>>array[j];
        }

        cout<<"\nThe Array entered is :: \n\n";

        for (int a=0;a<size;a++)
    {
                cout<<"Arr[ "<<a<<" ]  =  ";
                cout<<array[a]<<endl;
        }

        cout<<"\nEnter any Key To Search in Array :: ";
        cin>>key;
        int result;

        result=recursiveLinearSearch(array,key,size--);

        if(result==1) {
                cout<<"\nKey Found in Array .\n ";
        } else {
                cout<<"\nKey NOT Found in Array .\n ";
        }
        return 0;
}

OUTPUT : :

/*  C++ Program to implement Linear Search using recursion */

Enter Size Of Array :: 7

Enter [ 0 ] Element :: 1

Enter [ 1 ] Element :: 2

Enter [ 2 ] Element :: 3

Enter [ 3 ] Element :: 4

Enter [ 4 ] Element :: 5

Enter [ 5 ] Element :: 6

Enter [ 6 ] Element :: 7

The Array entered is ::

Arr[ 0 ]  =  1
Arr[ 1 ]  =  2
Arr[ 2 ]  =  3
Arr[ 3 ]  =  4
Arr[ 4 ]  =  5
Arr[ 5 ]  =  6
Arr[ 6 ]  =  7

Enter any Key To Search in Array :: 4

Key Found in Array .

Process returned 0

Above is the source code for C++ Program to implement Linear Search using recursion which is successfully compiled and run on Windows System.The Output of the program is shown above .

If you found any error or any queries related to the above program or any questions or reviews , you wanna to ask from us ,you may Contact Us through our contact Page or you can also comment below in the comment section.We will try our best to reach up to you in short interval.

Thanks for reading the post….