A recursive function is one that
a. Speeds up a program.
b. Is always slower than a nonrecursive function.
c. Calls itself
d. Calls no functions at all.
e. Calls another function
Part c) is the definition of a recursive function. To be a correct recursive function, enough more is necessary. At a minimum, there must be a guarantee termination.
Explanation: Parts a) and b). Recursion is unlikely to be faster, but with selected problems and selected CPU architecture, a recursive solution will be as fast as an iterative solution. Part d) is wrong. Part e) A recursive function certainly may calls another function, but this is neither required not definitive.
You might also like to view...
Which data validation method enables you to execute programming tasks whenever data in a table is changed?
A) Default value B) Data macro C) Input mask D) Validation rule
The Row ____________________ Lookup property stores the values for the drop-down list of a Lookup field.
Fill in the blank(s) with the appropriate word(s).
A tool that creates a report containing detailed information for each selected object.
What will be an ideal response?
Describe palm print and hand geometry recognition.Palm print recognition is a biometric modality that uses the physical structure of an individual's palm print for recognition purposes; hand geometry recognition uses the physical structure of an individual's hand for recognition purposes.PTS: 1 REF: 394. Describe the mechanics of a retinal scan.
What will be an ideal response?