If there were no base case for this function, we would get:
```
1 bool search( Node
2 {
3 if ( ptr == NULL )
4 return false;
5 if ( ptr->info == dove ) {
6 bird = ptr->info;
7 return true;
8 }
9 return search( ptr->next, bird, dove );
10 }
```
which is called for a linked list (where start points to the first node) using the lines of code:
```
if ( search( start, bird, dove ) )
cout << “search successful” << endl;
```
A. a compiler error
B. infinite recursion
C. a runtime error
D. an infinite function
1
You might also like to view...
Answer the following statements true (T) or false (F)
1. Generally, the more programs in memory, the greater the utilization of the processor. 2. The simplest approach to managing memory for multiple, concurrent programs, fixed- partition memory management, divides the available space into fixedlength partitions each of which holds one program. 3. Under dynamic memory management, the transient area is treated as a pool of unstructured free space and a program is loaded into a region allocated at load time. 4. With virtual memory management, little chunks of unused space spread throughout memory create a fragmentation problem. 5. With segmentation, programs are divided into independently addressed segments and stored in contiguous memory
In the figure above, which item represents wireless connections?
A. item 2 B. item 3 C. item 4 D. item 1
In a(n) ________ relationship one record in either table can relate to many records in the other table
A) many-to-one B) one-to-many C) one-to-one D) many-to-many
________ is the process of displaying only records that meet specific conditions
Fill in the blank(s) with correct word