Merge pull request #339 from habibasorour/issue_326_listing

Issue 326 fixed listing in 7.1

Author: pearcej

source/ch7_recursion.ptx

@@ -34,9 +34,10 @@
     as <md>n \times (n-1)!</md>.
 </p>
         <p>
-            Here is a Python implementation of factorial using just one function:
+            <xref ref="factorial-python-function" text="type-global"/> is the Python implementation of the factorial function. It checks for negative numbers, defines the base case for 0! and 1!, and implements the recursive step.
         </p>
-        <program xml:id="factorial-python-function" interactive="activecode" language="python">
+        <listing xml:id="factorial-python-function">
+        <program interactive="activecode" language="python">
             <code>
 def factorial(n):
     # Check for negative numbers
@@ -54,11 +55,17 @@ print(str(number) + "! is " + str(factorial(number)))
 
      </code>
         </program>
+        </listing>
 
         <p>
             Many Python programs organize related functions into classes. The same factorial function can be placed inside a class as a method instead of as a function. When this is done, you need to create an instance of the class in order to call the method. Below, we create the class <c>MathTools</c> with a method <c>factorial</c>, and we call it from the <c>main</c> function.
         </p>
-        <program xml:id="factorial-python-class" interactive="activecode" language="python">
+        <p>
+            <xref ref="factorial-python-class" text="type-global"/> is the Python implementation of the factorial function as a method within a class. It maintains the same logic as the previous function but is now encapsulated within a class structure.
+        </p>
+
+        <listing xml:id="factorial-python-class">
+        <program interactive="activecode" language="python">
             <code>
 class MTools:
     def factorial(self, n):
@@ -81,14 +88,16 @@ def main():
 main()
             </code>
         </program>
+        </listing>
 
         <p>
            See if you can spot the differences in the Java version below.
         </p>
         <p>
-            Here is the equivalent Java code:
+            <xref ref="factorial-java-class" text="type-global"/> is the Java implementation of the factorial function. It follows the same logic as the Python version but adapts to Java's syntax and type system.
         </p>
-        <program xml:id="factorial-java-class" interactive="activecode" language="java">
+        <listing xml:id="factorial-java-class">
+        <program interactive="activecode" language="java">
             <code>
 public class MTools {
     public static int factorial(int n) {
@@ -112,6 +121,7 @@ public class MTools {
 }
             </code>
         </program>
+        </listing>
         <p>
            Notice the key differences from Python: instead of <c>def factorial(n):</c>, Java uses <c>public static int factorial(int n)</c> which declares the method's visibility as <c>public</c>, that it belongs to the class rather than an instance (hence, <c>static</c>), the return type as integer, and the parameter type also as integer. The recursive logic—base case and recursive step—remains identical to Python, and, of course, all code blocks use curly braces <c>{}</c> instead of indentation.
         </p>