The following method implements the linear search of an array of integers using iteration. Implement a linear search function using recursion (no coding required). Which one will be more efficient? int linearSearchIterative (int data[], int n, int target) {

for (int i = 0; i < n; i++)
if (data[i] == target)
return i;
return -1;
}

When analyzing data sets, such as data for human heights or for human weights, a common step is to adjust the data. this can be done by normalizing to values between 0 and 1, or throwing away outliers. for this program, adjust the values by subtracting the smallest value from all the values. the input begins with an integer indicating the number of integers that follow. ex: if the input is 5 30 50 10 70 65, the output is: 20 40 0 60 55