/* It can be easily done using recursion.The following code snippet demonstrates it..*/ #include int search(int *p,int data,int size) { if(size==0) return 0; if(*p==data){ printf("match"); return 1; } int x=search(++p,data,size-1); return x; } void main() { int arr[]={1,8,6,3,0}; static int size=8; int t; t=search(arr,2,size-1); if(t==1) printf("found"); else printf("Not found"); }