1 / 40

Figure 2.1 A recursive solution

Figure 2.1 A recursive solution. Figure 2.2 fact(3). Figure 2.3 A box. Figure 2.4 The beginning of the box trace. Figure 2.5a Box trace of fact(3). Figure 2.5b Box trace of fact(3). Figure 2.5c Box trace of fact(3). Figure 2.6 A recursive solution. Figure 2.7a

munden
Télécharger la présentation

Figure 2.1 A recursive solution

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Figure 2.1 A recursive solution

  2. Figure 2.2 fact(3)

  3. Figure 2.3 A box

  4. Figure 2.4 The beginning of the box trace

  5. Figure 2.5a Box trace of fact(3)

  6. Figure 2.5b Box trace of fact(3)

  7. Figure 2.5c Box trace of fact(3)

  8. Figure 2.6 A recursive solution

  9. Figure 2.7a Box trace of writeBackward(“cat”, 3)

  10. Figure 2.7b Box trace of writeBackward(“cat”, 3)

  11. Figure 2.7c Box trace of writeBackward(“cat”, 3)

  12. Figure 2.8a Box trace of writeBackward(“cat”, 3) in pseudocode

  13. Figure 2.8b Box trace of writeBackward(“cat”, 3) in pseudocode

  14. Figure 2.8c Box trace of writeBackward(“cat”, 3) in pseudocode

  15. Figure 2.8d Box trace of writeBackward(“cat”, 3) in pseudocode

  16. Figure 2.8e Box trace of writeBackward(“cat”, 3) in pseudocode

  17. Figure 2.8f Box trace of writeBackward(“cat”, 3) in pseudocode

  18. Figure 2.9a Box trace of writeBackward2(“cat”, 3) in pseudocode

  19. Figure 2.9b Box trace of writeBackward2(“cat”, 3) in pseudocode

  20. Figure 2.9c Box trace of writeBackward2(“cat”, 3) in pseudocode

  21. Figure 2.9d Box trace of writeBackward2(“cat”, 3) in pseudocode

  22. Figure 2.9e Box trace of writeBackward2(“cat”, 3) in pseudocode

  23. Figure 2.10 Recursive solution to the rabbit problem

  24. Figure 2.11 Recursive calls that rabbit(7) generates

  25. Figure 2.12 The recursive calls that c(4, 2) generates

  26. Figure 2.13 Recursive solution to the largest-item problem

  27. Figure 2.14 The recursive calls that maxArray(<1, 6, 8, 3>) generates

  28. Figure 2.15 Box traces of binarySearch with anArray = <1,5,9,12,15,21,29,31>: a) a successful search for 9; b) an unsuccessful search for 6

  29. Figure 2.16 Box trace with reference to an array

  30. Figure 2.17 A sample array

  31. Figure 2.18 A partition about a pivot

  32. Figure 2.19a and b a) The initial state; b) move n - 1 disks from A to C

  33. Figure 2.19c and d c) move one disk from A to B; d) move n - 1 disks from C to B

  34. Figure 2.20 The order of recursive calls that results from solveTowers(3, A, B, C)

  35. Figure 2.21a Box trace of solveTowers(3, ‘A’, ‘B’, ‘C’)

  36. Figure 2.21b Box trace of solveTowers(3, ‘A’, ‘B’, ‘C’)

  37. Figure 2.21c Box trace of solveTowers(3, ‘A’, ‘B’, ‘C’)

  38. Figure 2.21d Box trace of solveTowers(3, ‘A’, ‘B’, ‘C’)

  39. Figure 2.21e Box trace of solveTowers(3, ‘A’, ‘B’, ‘C’)

More Related