Binary Exponentiation || Fast Power || O(logn) || Very important for Competitive Programming

Binary Exponentiation is used in calculating power in time complexity O(log(n)). It also called Fast Power algorithm. Very useful for Competitive Programming.

Social Media:
******
All materials in these videos are used for educational purposes and fall within the guidelines of fair use. No copyright infringement is intended. If you are or represent the copyright owner of materials used in this video and have a problem with the use of said material, please contact me via my email in the "about" page on my channel.
******

#binaryexponentiation #fastpower #competitiveprogramming

[sawvikdipto]

nice video . I have understood after so many videos

[hemanthkumarallam]

Thank you for sharing with us learned new concept.

[fardeen]

Hey can you tell some very good source for DSA and which coding platform we should use 1st

[himanshugupta]

i am in 3rd year so should i prepare for placememnts or GATE