Scribd Logo
Upload

Welcome to Scribd!

  • Untitled

    Uploaded by

    Muskan Sharma
    9 views2 pages
    The document discusses three different operations on arrays in C++: 1) Traversing an array - It takes user input for the size of an array and elements, and then traverses the array printing out each element. 2) Linear search in an array - It defines a linear search function that searches for a key in an array and returns its index if found, else returns -1. 3) Insertion in an array - It demonstrates inserting an element into a specific index of an array, by shifting the elements after that index and making space for the new element.

    Original Description:

    Copyright

    © © All Rights Reserved

    Available Formats

    TXT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document discusses three different operations on arrays in C++: 1) Traversing an array - It takes user input for the size of an array and elements, and then traverses the array printing out each element. 2) Linear search in an array - It defines a linear search function that searches for a key in an array and returns its index if found, else returns -1. 3) Insertion in an array - It demonstrates inserting an element into a specific index of an array, by shifting the elements after that index and making space for the new element.

    Copyright:

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

    Untitled

    Uploaded by

    Muskan Sharma
    The document discusses three different operations on arrays in C++: 1) Traversing an array - It takes user input for the size of an array and elements, and then traverses the array printing out each element. 2) Linear search in an array - It defines a linear search function that searches for a key in an array and returns its index if found, else returns -1. 3) Insertion in an array - It demonstrates inserting an element into a specific index of an array, by shifting the elements after that index and making space for the new element.

    Copyright:

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

    traversing array

    #include<iostream>
    using namespace std;
    int main(){
    int n;
    cin>>n;
    int arr[n];
    for(int i=0;i<n;i++){
    cin>>arr[i];
    }
    for(int i=0;i<n;i++){
    cout<<arr[i]<<" ";
    }
    return 0;
    }

    SEARCHING IN ARRAY

    #include<iostream>
    using namespace std;
    int linearsearch(int arr[] ,int n, int key){
    for(int i=0;i<n;i++){
    if(arr[i]==key){
    return i;
    }
    }
    return -1;
    }

    int main(){
    int n;
    cin>>n;

    int arr[n];
    for(int i=0;i<n;i++)
    { cin>>arr[i];}
    int key;
    cin>>key;
    cout<<linearsearch(arr,n,key );
    return 0;
    }

    INSERTION IN ARRAY

    #include <stdio.h>
    int main() {

    int la[] = {1,3,5,7,8};

    int item = 10, k = 3, n = 5;


    int i=0,j=n;
    printf("The original array elements are :\n");
    for(i=0; i<n; i++)
    { printf("LA[%d] = %d\n", i, la[i]);

    n = n + 1;
    while (j >= k)
    { la[j+1] = la[j];

    j=j-1;

    }
    la[k] = item;

    printf("The array elements after insertion : \n");


    for(i=0; i<n; i++)
    { printf("la[%d] = %d\n", i, la[i]);
    }
    }

    You might also like