Completion requirements
View
Now that you understand the concept behind repeated squares, we can introduce an algorithm that uses base two (binary) to represent the exponent. Pay close attention to how this choice can result in a massive speed-up for computing the repeated squares.
Source: Michael Lin, https://www.youtube.com/watch?v=0iW3hubeYoI This work is licensed under a Creative Commons Attribution 3.0 License.