In a linear equation, the best-, worst-, and average-case behaviors are O(1).

Answer the following statements true (T) or false (F)

1. To call a function with an array parameter, write the array argument as the array name followed by empty square brackets, as in f(a[], 7); (The first argument is an array a, the second is the size.) 2. Consider the array declaration, int x[20];. There is no memory allocated for x[20]. 3. Arrays in C++ may have several different types stored in them. 4. Given the two C++ array declarations: int a[10], b[10]; You can successfully compute one array, say a, then assign b to a: a = b; 5. In the sequential search algorithm, items are examined alternately, odd then evens, in order to find whether the target value is in the array (and if the target is present, to the index of the target.)

An unnecessary nested selection structure may still produce the correct results, but is less efficient.

Answer the following statement true (T) or false (F)