feat: Add binary exponentiation algorithm

[dcq-31]

Add Binary Exponentiation algorithm to Divide and Conquer category

Summary

Adds Binary Exponentiation — the classic O(log n) fast-power algorithm — to the existing Divide and Conquer / Divide y vencerás category, which previously contained only Tower of Hanoi. Computes aⁿ by halving the exponent at each recursive step, visualized through the call stack concept so the logarithmic recursion depth is immediately visible.

Changes

• New algorithm: src/lib/algorithms/divide-and-conquer.ts adds binaryExponentiation (concept / callStack visualization, bilingual steps via the d() helper).
• Registry: Imports the algorithm and registers it in src/lib/algorithms/index.ts under the existing Divide and Conquer category.
• i18n: Adds full English + Spanish descriptions for binary-exponentiation in src/i18n/translations.ts.
• READMEs: Adds Binary Exponentiation to the Divide & Conquer / Divide y vencerás sections in both README.md and README_ES.md. Also adds the previously omitted Bucket Sort entry to the Sorting / Ordenamiento sections — Bucket Sort was already implemented in src/lib/algorithms/sorting.ts and registered in index.ts but had never been listed in the READMEs.

Visualization

Trace of binPow(2, 10) = 1024 shown as an animated call stack across 11 steps:

1. Empty stack — intro framing the problem.
2. Descent (4 frames pushed): each level halves the exponent (10 → 5 → 2 → 1 → 0), with the active frame highlighting orange and earlier frames marked waiting.
3. Base case at binPow(2, 0): returns 1, frame highlights green.
4. Ascent (4 frames popped): each resolved frame shows its computation in the detail line — e.g. half=4, 5 is odd → 4×4×2 = 32.
5. Empty stack — done. Final result 1024 with the takeaway: 4 recursive calls instead of 9 naive multiplications, demonstrating O(log n).

Both the even-exponent case (half × half) and the odd-exponent case (half × half × base) appear in this single trace, since 10 has bits in both positions (10 = 1010₂).

[vercel]

@dcq-31 is attempting to deploy a commit to the midudev pro Team on Vercel.

A member of the Team first needs to authorize it.