Implementation of List using Arrays lab program

 #include<stdio.h>

#include<conio.h>

int n,a[20];

void create();

int insert(int,int);

void display();

void find(int);

int  del(int);

void update(int,int);

void count();

int main()

{

int choi,ele,pos,val;

clrscr();

printf("enter no ele in list \n");

scanf("%d",&n);

while(1)

{

clrscr();

printf("\t\t List Adt using arrays \n");

printf("1.create \n");

printf("2.insert \n");

printf("3.display \n");

printf("4.find \n");

printf("5.delete \n");

printf("6.update\n");

printf("7.count\n");

printf("8.exit \n");

printf("enter choice \n");

scanf("%d",&choi);

switch(choi)

{

case 1:create();

break;

case 2:printf("enter at what position u want to enter\n");

scanf("%d",&pos);

printf("enter at value u want to insert\n");

scanf("%d",&val);

n=insert(pos,val);

break;

case 3:display();

break;

case 4:printf("enter ele to be searched\n");

scanf("%d",&val);

find(val);

break;

case 5:printf("enter at what position u want to enter\n");

scanf("%d",&pos);

n=del(pos);

break;

case 6:printf("enter pos to upadte\n");

scanf("%d",&pos);

printf("enter value to upadate\n");

scanf("%d",&val);

update(pos,val);

break;

case 7:count();

break;

case 8:exit(0);

break;

}

}

}

void create()

{

int i;

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

{

printf("enter ele of list\n");

scanf("%d",&a[i]);

}

}

int  insert(int pos,int val)

{

int i;

for(i=n-1;i>=pos;i--)

a[i+1]=a[i];

a[pos]=val;

return n+1;

}

void display()

{

int i;

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

printf("\nele of list are =%d",a[i]);

getch();

}

int del(int pos)

{

int i;

for(i=pos;i<n-1;i++)

{

a[i]=a[i+1];

}

return n-1;

}

void find(int val)

{

int i,flag=0;

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

{

if(val==a[i])

{

flag=1;

break;

}

}

if(flag==1)

{

printf("ele found in list at=%d",i);

getch();

}

else

printf("ele not found");

}

void update(int pos,int val)

{

a[pos]=val;

}

void count()

{

printf("no of ele in the list =%d",n);

getch();

}