Non Partitioned Array Processing
Processing every element of the array
Example: Sum all values in an array
void main()
{const int N = 10;
int Array[N] = {1,2,3,4,5,63,5,7,5,63};
int Sum=0; int k;
for (k=0; k<N; k++)
{ Sum = Sum + Array[k]
}
cout << " The sum of the array elements is: " << Sum;
}
Linear Search
- searching for something which is guaranteed to be in the search space
Bounded Linear Search
- searching for something which we are not guaranteed to find in the search space