delete(arr[],size,del) cost

frequency
1 int i=0 c1
1
2 for(i=0; i<size; i++) c2
n
{
3 if(arr[i]==del) c3 n
{
4 for(int j=i; j<(size-1); j++) c4 n-1
{
5 arr[j]=arr[j+1]; c5 n-1
}
6 count++; c6 1
7 break; c7 1
}
}

T(n)=c1+(c2+c3)n+(c4+c5)n-1+c6+c7
=c10+c11n
O(n)