Determine the order of the recursive maze solution presented in this chapter.
What will be an ideal response?
The time complexity of the maze solution is deterimined by looking at the number of potential moves or potential paths through the maze. Given that from any given position within the maze there are 4 potential moves (ignoring edges for the purpose of this reasoning) and that there are n positions in the maze, that yields a time complexity of O(4n). For example, if the starting location were in the middle of the maze, away from an edge, then from that starting location there are four possible moves. From each of those moves there four more possible moves resulting in sixteen possibilities from out starting position. Even though there are some limitations for edges and for not returning to the previous position, the resulting time complexity is still exponential.
You might also like to view...
____ is the universal coding scheme for characters.
A. EBCDIC B. ANSI C. ASCII D. Unicode
A ________ is a text box and a list that is hidden until you click its arrow
A) combo box B) results box C) lookup field D) bracket box
Which method of transmission divides the stream of information into small bits and maps them to a spreading code?
a. Direct-sequence spread spectrum b. Frequency-hopping spread spectrum c. Carrier sense multiple access with collision detection d. Carrier sense multiple access with collision avoidance
What is the difference between an operational environment and a test environment?
What will be an ideal response?