Add Euclidian GCD and Binary Exponentiation Visualisations

[Varun0157]

What’s Included

1. New Algorithm Modules

   • algorithms/binary-exponentiation.typ

     • Formal recursive definition.
     • Mapcode-style specification (rho, F, pi).
     • Concrete computation for a sample instance.
     • Full computation visualization using the project’s mapcode-viz framework.
     • Includes visualization of the base value at each step.

   • algorithms/gcd.typ

     • Formal recursive definition (Euclidean algorithm).
     • Mapcode-style specification (rho, F, pi).
     • Concrete computation for a sample instance.
     • Full computation chain visualization using the project’s mapcode-viz framework.

2. Documentation Integration

   • Updated main.typ:
     • Added #include "algorithms/binary-exponentiation.typ"
     • Added #include "algorithms/gcd.typ"
     • Ensures these new algorithm chapters appear in the output document.

Why This Matters

• Expands the range of classical algorithms visualized within the mapcode framework, providing diverse examples of recursive modeling.
• Demonstrates different types of recursive patterns: linear recursion with exponent halving for binary exponentiation, and the Euclidean algorithm for GCD.
• Serves as templates for future algorithm additions, particularly for numerical and iterative recursive problems.
• Enhances the overall documentation and educational value of the mapcode-viz project.

Files Changed

• algorithms/binary-exponentiation.typ
• algorithms/gcd.typ
• main.typ

No existing code modified; additions are isolated and non-breaking.

Checklist

• Builds successfully
• Renders correctly in main.typ
• Follows repository style and structure
• No backward-incompatible changes