Which of the following is NOT a type of graph?

What is the efficiency of linear search?

a. O(1). b. O(log n). c. O(n). d. O(n2).

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

1. A method definition that includes a call to itself is said to be recursive. 2. When a recursive call is encountered, computation is temporarily suspended; all of the information needed to continue the computation is saved and the recursive call is evaluated.