Issue 644 ch5

pretext/Recursion/ComplexRecursiveProblems.ptx

@@ -8,5 +8,8 @@
             to solve using recursion. We will finish up by looking at a deceptive
             problem that at first looks like it has an elegant recursive solution
             but in fact does not.</p>
+            <conclusion><p>
+                <!-- extra space before the progress bar -->            
+            </p></conclusion>
     </section>
 

pretext/Recursion/DiscussionQuestions.ptx

@@ -15,5 +15,8 @@
                     In addition to the usual coins assume that you have an 8 cent coin.</p>
             </li>
         </ol></p>
+        <conclusion><p>
+            <!-- extra space before the progress bar -->            
+        </p></conclusion>
     </section>
 

pretext/Recursion/DynamicProgramming.ptx

@@ -534,5 +534,8 @@ main()
                 </input></program></statement>
             </task>
         </exploration>
+        <conclusion><p>
+            <!-- extra space before the progress bar -->            
+        </p></conclusion>
     </section>
 

pretext/Recursion/ExploringaMaze.ptx

@@ -503,4 +503,7 @@ main()
 X    ++
 +++++++
     </input></program>
+    <conclusion><p>
+        <!-- extra space before the progress bar -->            
+    </p></conclusion>
 </section>

pretext/Recursion/Glossary.ptx

@@ -111,5 +111,8 @@
                 </gi>
 
         </glossary>
+        <conclusion><p>
+            <!-- extra space before the progress bar -->            
+        </p></conclusion>
     </section>
 

pretext/Recursion/Matching.ptx

@@ -71,4 +71,7 @@
       </match>
     </matches>
   </exercise>
+  <conclusion><p>
+    <!-- extra space before the progress bar -->            
+</p></conclusion>
 </section>

pretext/Recursion/Objectives.ptx

@@ -24,7 +24,9 @@
         </ul></p>
 
 
-
+        <conclusion><p>
+            <!-- extra space before the progress bar -->            
+        </p></conclusion>
 
     </section>
 

pretext/Recursion/SelfCheck.ptx

@@ -81,4 +81,7 @@
       </choice>
     </choices>
   </exercise>
+  <conclusion><p>
+    <!-- extra space before the progress bar -->            
+</p></conclusion>
 </section>

pretext/Recursion/StackFramesImplementingRecursion.ptx

@@ -112,5 +112,8 @@ main()
             function. Even though we are calling the same function over and over,
             each call creates a new scope for the variables that are local to the
             function.</p>
+            <conclusion><p>
+                <!-- extra space before the progress bar -->            
+            </p></conclusion>
     </section>
 

pretext/Recursion/Summary.ptx

@@ -30,4 +30,7 @@
       </li>
     </ul>
   </p>
+  <conclusion><p>
+    <!-- extra space before the progress bar -->            
+</p></conclusion>
 </section>

pretext/Recursion/TheThreeLawsofRecursion.ptx

@@ -224,5 +224,8 @@ int main(){
 
     </exercise>
 </reading-questions>   
+<conclusion><p>
+    <!-- extra space before the progress bar -->            
+</p></conclusion>
     </section>
 

pretext/Recursion/TowerofHanoi.ptx

@@ -184,6 +184,9 @@ main()
                         </condition>
                     </var></setup>
                 </exercise>
-            </reading-questions>   
+            </reading-questions> 
+            <conclusion><p>
+                <!-- extra space before the progress bar -->            
+            </p></conclusion>  
     </section>
 

pretext/Recursion/WhatIsRecursion.ptx

@@ -6,5 +6,8 @@
             involves a function calling itself. While it may not seem like much on
             the surface, recursion allows us to write elegant solutions to problems
             that may otherwise be very difficult to program.</p>
+            <conclusion><p>
+                <!-- extra space before the progress bar -->            
+            </p></conclusion>
     </section>
 

pretext/Recursion/pythondsCalculatingtheSumofaListofNumbers.ptx

@@ -172,5 +172,8 @@ main()
                 <description><p>Diagram illustrating the resolution of recursive function calls summing a list of numbers. The bottom box shows 'sum(9)' equaling '9', with an arrow pointing left to the next box 'sum(7,9)' showing '7 + 9'. Above that, 'sum(5,7,9)' equals '5 + 16', then 'sum(3,5,7,9)' with '3 + 21', and at the top, 'sum(1,3,5,7,9)' resulting in '1 + 24'. Each function call resolves to a value that is used in the computation of the previous call, with the final sum at the top being '25'.</p></description>
                 </image>
             </figure>
+            <conclusion><p>
+                <!-- extra space before the progress bar -->            
+            </p></conclusion>
     </section>
 

pretext/Recursion/pythondsConvertinganIntegertoaStringinAnyBase.ptx

@@ -260,6 +260,9 @@ int main(){
         </input>
     </program>
             </blockquote>
-        </reading-questions>   
+        </reading-questions>  
+        <conclusion><p>
+            <!-- extra space before the progress bar -->            
+        </p></conclusion> 
     </section>
 

pretext/Recursion/pythondsProgrammingExercises.ptx

@@ -127,5 +127,8 @@
                     words.</p>
             </li>
         </ol></p>
+        <conclusion><p>
+            <!-- extra space before the progress bar -->            
+        </p></conclusion>
     </section>
 

pretext/Recursion/pythondsSierpinskiTriangle.ptx

@@ -174,5 +174,8 @@ main()
             methods.</p>
         <p>The above sierpinski triangle visualization utilizes C-Turtle, a C++ equivalent of
             Python's <c>turtle</c> library, and can be found on GitHub here: <url href="https://github.com/walkerje/C-Turtle/" visual="https://github.com/walkerje/C-Turtle/">https://github.com/walkerje/C-Turtle/</url></p>
+            <conclusion><p>
+                <!-- extra space before the progress bar -->            
+            </p></conclusion>
     </section>
 

pretext/Recursion/pythondsintro-VisualizingRecursion.ptx

@@ -273,5 +273,8 @@ main()
         </input>
     </program>
 </reading-questions>  
+<conclusion><p>
+    <!-- extra space before the progress bar -->            
+</p></conclusion>
     </section>