Scribd Logo
Upload

Welcome to Scribd!

  • Deletion

    Uploaded by

    Kiran Hegde
    5 views2 pages
    The document contains C and C++ code to delete an element from an array. It defines a ls function to find the position of the element to delete and a delete function that shifts elements to fill the gap and returns the new size. The main function calls ls and delete to remove an element from a sample array and prints the resulting array.

    Original Description:

    Original Title

    deletion

    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 contains C and C++ code to delete an element from an array. It defines a ls function to find the position of the element to delete and a delete function that shifts elements to fill the gap and returns the new size. The main function calls ls and delete to remove an element from a sample array and prints the resulting array.

    Copyright:

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

    Deletion

    Uploaded by

    Kiran Hegde
    The document contains C and C++ code to delete an element from an array. It defines a ls function to find the position of the element to delete and a delete function that shifts elements to fill the gap and returns the new size. The main function calls ls and delete to remove an element from a sample array and prints the resulting array.

    Copyright:

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

    \\C

    #include <stdio.h>

    int delete(int arr[],int n,int x, int pos){


    if (pos==-1){
    return n;
    }
    for (int i=pos;i<n;i++){
    arr[i]=arr[i+1];
    }
    return n-1;
    }

    int ls(int arr[],int n,int x){


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

    int main(void){
    int arr[]={6,8,7,3,4};
    int n=sizeof(arr)/sizeof(arr[0]);
    int x=7;
    int pos=ls(arr,n,x);

    n=delete(arr,n,x,pos);
    for (int i=0;i<n;i++){
    printf("%d\n",arr[i]);
    }
    return 0;
    }

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

    int del(int arr[],int n,int x,int pos){


    if (pos==-1){
    return n;
    }
    for (int i=pos;i<n;i++){
    arr[i]=arr[i+1];
    }
    return n-1;
    }

    int ls(int arr[],int n,int x){


    for (int i=0;i<n;i++){
    if (arr[i]==x){
    return i;
    }
    }
    return -1;
    }
    int main(void){
    int arr[]={4,6,8,2,9};
    int n=sizeof(arr)/sizeof(arr[0]);
    int x=2;
    int pos=ls(arr,n,x);
    n=del(arr,n,x,pos);

    for (int i=0;i<n;i++){


    cout<<arr[i]<<"\n";
    }
    return 0;
    }

    You might also like