Scribd Logo
Upload

Welcome to Scribd!

  • LCS2022052 DAA Lab02

    Uploaded by

    Sonu
    6 views2 pages
    The document describes a C++ program that implements linear search on an array. The program takes user input for the array size and elements, as well as a search value. It defines a LinearSearch function that searches the array for the given value using a for loop and returns the index if found, or -1 if not found. It then calls LinearSearch, prints the result, and returns 0 to end the program successfully.

    Original Description:

    Design and analysis of alogorithm papers

    Original Title

    LCS2022052_DAA_lab02

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document describes a C++ program that implements linear search on an array. The program takes user input for the array size and elements, as well as a search value. It defines a LinearSearch function that searches the array for the given value using a for loop and returns the index if found, or -1 if not found. It then calls LinearSearch, prints the result, and returns 0 to end the program successfully.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    6 views2 pages

    LCS2022052 DAA Lab02

    Uploaded by

    Sonu
    The document describes a C++ program that implements linear search on an array. The program takes user input for the array size and elements, as well as a search value. It defines a LinearSearch function that searches the array for the given value using a for loop and returns the index if found, or -1 if not found. It then calls LinearSearch, prints the result, and returns 0 to end the program successfully.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 2

    Umesh Singh Verma (LCS2022052)

    Design Analysis of Algorithm – Lab 02 Topic – Implementaion of Linear Search

    Code:
    #include <bits/stdc++.h>
    using namespace std;

    int LinearSearch(int arr[], int N, int x)


    {
    for (int i = 0; i < N; i++)
    if (arr[i] == x)
    return i;
    return -1;
    }

    int main()
    {
    int n;
    cout << "Enter no of elements in the array ";
    cin >> n;
    int arr[n];
    cout << "Enter array elements :";
    for (int i = 0; i < n; i++)
    {
    cin >> arr[i];
    }
    int x;
    cout << "Enter a no: ";
    cin >> x;
    int e = sizeof(arr) / sizeof(arr[0]);
    int result = LinearSearch(arr, e, x);
    if (result == -1)
    {
    cout << "Element is not present in array" << endl;
    }
    else
    {
    cout << "Element is present at index " << result << endl;
    }
    return 0;
    }
    Screen shot of the output:

    You might also like