Since we all know that the worst case is O(n). Why are you still trying to show some binary-like algorithm?

Just linear search!

```
public class Solution {
public boolean search(int[] A, int target) {
for(int i=0;i<A.length;i++){
if(A[i] == target) return true;
}
return false;
}
}
```

This got accepted. LOL