Write a program to delete the given element which may be present at any position from the given array

Source Code

#include<stdio.h>
#include<conio.h>
int main (int argc, char *argv[])
{
  clrscr();
  int ar[100];
  int r,p,i;
  for(i=0;i<100;i++)
  {
    ar[i]=0;
  }
  printf("\n Enter the range of the array:(less than 100) ");
  scanf("%d",&r);
  printf("\n Enter the elements of the array:");
  for(i=0;i<r;i++)
  {
       printf("\n Enter element number: %d ",(i+1));
       scanf("%d",&ar[i]);
  }
  printf("\n Enter the position where element is to be deleted:");
  scanf("%d",&p);
  for(i=p-1;i<r;i++)
  {
        ar[i]=ar[i+1];
  }
  printf("\n The Elements of array are:");
  for(i=0;i<r-1;i++)
  {
    printf("%d ",ar[i]);
  }
  getch();
}

Find More from our code collection
Armstrong number, binary number to a decimal number, bubble sort, decimal number to binary number, factorial of the given number factors, fibonacci numbers, HCF and LCM, matrix, mergesort, salary of the employee. palindrome, quadratic equation, star patterns, series etc. and much more...
#Return to Example Source Code