Thêm:

void chen(int a[ ],int n,int x,int k)

{

if (k>n+1 ll k<0)

cout <<" vi tri ko phu hop";

else

{

if(n>max) cout<<"day ds"

else

             {

              for (i= n+1;i>=k+1;i--)

                    a[i]=a[i-1];

                    a[k]=x;

                  n=n+1;

             }

}

Xoa:

void xoa(int a[];int n;int k)

{

if(n==0)  

cout <<"ds rong"

else

{

if(k<=0 llk>=n+1)

cout<<"vi tri ko fu hop"

else

{

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

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

n=n-1;

}

}

}

Tim kiem tuan tu

int  Tk(int a[], int n,int x)

{

for(int i=1;i<=n;i++)

if(a[i]==x)

return i;

return 0;

}