![ARRAY IMPLEMENTATION
#include <stdio.h>
#include<stdlib.h>
void insertbeg(int);
void insertend(int);
void insertmiddle(int,int);
void display();
int delete(int);
int search(int);
int a[5];
int i=0;
int main()
{
int ch,num,loc,pos;
while(1)
{
printf("1.insert at the beginingn");
printf("2.insert at the endn");
printf("3.insert at the middlen");
printf("4.display the listn");
printf("5.delete from the listn");
printf("6.search an element in the listn");
printf("7.exitn");
printf("enter ur choicen");
scanf("%d",&ch);
switch(ch)
{
case 1: printf("enter the element to be insertedn");
scanf("%d",&num);
insertbeg(num);
break;
case 2: printf("enter the element to be insertedn");
scanf("%d",&num);
insertend(num);
break;
case 3: printf("enter the element and position inthe listn");
scanf("%d%d",&num,&pos);
insertbeg(num);
break;
case 4: display();
break;
case 5: printf("enter the element to be deletedn");
scanf("%d",&num);](https://image.slidesharecdn.com/arraylist-160106085803/85/Array-list-1-320.jpg)
![loc=delete(num);
if(loc==-1)
printf("element not found in the listn");
else
printf("element successfully deletedn");
break;
case 6: printf("enter the element to be searchedn");
scanf("%d",&num);
loc=search(num);
if(loc==0)
printf("element not found in the listn");
break;
case 7: exit(1);
break;
default: printf("u entered invalid choicen");
}
}
}
void insertbeg(int num)
{
int j;
for(j=i;j>0;j--)
{
a[j]=a[j-1];
}
a[j]=num;
i++;
}
void insertend(int num)
{
a[i]=num;
i++;
}
void insertmiddle(int num,int pos)
{
int j;
for(j=i;j>=pos;j--)
{
a[j]=a[j-1];
}
a[j]=num;
i++;
}
void display()
{
int j;
for(j=0;j<i;j++)
{
printf("%dn",a[j]);](https://image.slidesharecdn.com/arraylist-160106085803/85/Array-list-2-320.jpg)
![}
}
int delete(int num)
{
int j,pos;
for(j=0;j<i;j++)
{
if(a[j]==num)
break;
}
if(j>i)
return -1;
pos=j;
for(j=pos;j<i;j++)
{
a[j]=a[j+1];
}
a[j-1]=NULL;
}
int search(int num)
{
int j;
for(j=0;j<i;j++)
{
if(a[j]==num)
{
printf("element found at %dn",j+1);
break;
}
}
return 0;
}](https://image.slidesharecdn.com/arraylist-160106085803/85/Array-list-3-320.jpg)
Array list
- 1. ARRAY IMPLEMENTATION #include <stdio.h> #include<stdlib.h> void insertbeg(int); void insertend(int); void insertmiddle(int,int); void display(); int delete(int); int search(int); int a[5]; int i=0; int main() { int ch,num,loc,pos; while(1) { printf("1.insert at the beginingn"); printf("2.insert at the endn"); printf("3.insert at the middlen"); printf("4.display the listn"); printf("5.delete from the listn"); printf("6.search an element in the listn"); printf("7.exitn"); printf("enter ur choicen"); scanf("%d",&ch); switch(ch) { case 1: printf("enter the element to be insertedn"); scanf("%d",&num); insertbeg(num); break; case 2: printf("enter the element to be insertedn"); scanf("%d",&num); insertend(num); break; case 3: printf("enter the element and position inthe listn"); scanf("%d%d",&num,&pos); insertbeg(num); break; case 4: display(); break; case 5: printf("enter the element to be deletedn"); scanf("%d",&num);
- 2. loc=delete(num); if(loc==-1) printf("element not found in the listn"); else printf("element successfully deletedn"); break; case 6: printf("enter the element to be searchedn"); scanf("%d",&num); loc=search(num); if(loc==0) printf("element not found in the listn"); break; case 7: exit(1); break; default: printf("u entered invalid choicen"); } } } void insertbeg(int num) { int j; for(j=i;j>0;j--) { a[j]=a[j-1]; } a[j]=num; i++; } void insertend(int num) { a[i]=num; i++; } void insertmiddle(int num,int pos) { int j; for(j=i;j>=pos;j--) { a[j]=a[j-1]; } a[j]=num; i++; } void display() { int j; for(j=0;j<i;j++) { printf("%dn",a[j]);
- 3. } } int delete(int num) { int j,pos; for(j=0;j<i;j++) { if(a[j]==num) break; } if(j>i) return -1; pos=j; for(j=pos;j<i;j++) { a[j]=a[j+1]; } a[j-1]=NULL; } int search(int num) { int j; for(j=0;j<i;j++) { if(a[j]==num) { printf("element found at %dn",j+1); break; } } return 0; }