#include <stdio.h>
int linearSearch(int*A[10], int v, int n){
int c;
for (c = 0; c < n; c++)
{
if (A[c] == v)
{
printf("%d is present at location %d.\n", v
, c
+1); break;
}
};
if (c == n)
printf("%d is not present in array.\n", v
); return 0;
}
int main()
{
int v, n;
n = 10;
int A[10] = {1,2,3,4,5,6,7,8,9,10};
v= 5;
linearSearch(A[10], v, n);
return 0;
}
I2luY2x1ZGUgPHN0ZGlvLmg+CiAKIAppbnQgbGluZWFyU2VhcmNoKGludCpBWzEwXSwgaW50IHYsIGludCBuKXsKCWludCBjOwoJZm9yIChjID0gMDsgYyA8IG47IGMrKykKICAgewogICAgICBpZiAoQVtjXSA9PSB2KSAgIAogICAgICB7CiAgICAgICAgIHByaW50ZigiJWQgaXMgcHJlc2VudCBhdCBsb2NhdGlvbiAlZC5cbiIsIHYsIGMrMSk7CiAgICAgICAgIGJyZWFrOwogICAgICB9CiAgIH07CiAgIGlmIChjID09IG4pCiAgICAgIHByaW50ZigiJWQgaXMgbm90IHByZXNlbnQgaW4gYXJyYXkuXG4iLCB2KTsKICAgcmV0dXJuIDA7CgkKfSAKCmludCBtYWluKCkKewogaW50IHYsIG47CiBuID0gMTA7CiBpbnQgQVsxMF0gPSB7MSwyLDMsNCw1LDYsNyw4LDksMTB9Owogdj0gNTsKIGxpbmVhclNlYXJjaChBWzEwXSwgdiwgbik7CiAKIHJldHVybiAwOwp9