1.

public static int Search(int[] data, int item)

{

int n = data.Length;

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

if (data[i] == item)

return i;

return -1;

}

Time Complexity: _____________

Space Complexity: _____________