feat: add binary exponentiation algorithm

[PraneethJain]

Description of Change

Implementation of the binary exponentiation algorithm, which calculates the nth power of an integer in O(log(n)) time.

Checklist

• Added description of change
• Added file name matches File name guidelines
• Added tests and example, test must pass
• Relevant documentation/comments is changed or added
• PR title follows semantic commit guidelines
• Search previous suggestions before making a new one, as yours may be a duplicate.
• I acknowledge that all my contributions will be made under the project's license.

[PraneethJain]

Hey @realstealthninja, I've made the requested changes. Could you re review this?

[realstealthninja]

Great work i recommend adding more descriptive variables;
yes a and n are the common math notation but it increases readability imo.
but its completely fine if you prefer a^n notation lmk

[realstealthninja]

Thank you so much for contributing!!! ❤️ the code is very elegant to read!

[github-actions]

This pull request has been automatically marked as abandoned because it has not had recent activity. It will be closed if no further activity occurs. Thank you for your contributions.

[PraneethJain]

Hey, could someone review this?

[realstealthninja]

requires review of code owners i'm afraid

[github-actions]

This pull request has been automatically marked as abandoned because it has not had recent activity. It will be closed if no further activity occurs. Thank you for your contributions.

[PraneethJain]

@Panquesito7