SUM and COUNT are examples of ________ functions that perform calculations on entire columns of data

Which of these is generally thought of as a high-performance technique?

a) bubble sort b) linear search c) binary search d) iteration

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

1. In a recursive solution, the base case is always the first case to be called. 2. Indirect recursion means that a function calls itself n number of times and then processing of the function starts from the first call. 3. A recursive function cannot call another function. 4. Recursive algorithms are less efficient than iterative algorithms.