Skip to content

The fast exponentiation algorithm implemented in WebAssembly. Calculates x^y in O(logn) complexity.

Notifications You must be signed in to change notification settings

kaplanbar/fast-exponentiation-wasm

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

9 Commits
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Fast Exponentiation in WebAssembly

Fast exponentiation algorithm implemented in WebAssembly using bitwise operators. Currently, it calculates x^y only for values that can fit to 32 bits.

About

The fast exponentiation algorithm implemented in WebAssembly. Calculates x^y in O(logn) complexity.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published