How to make a fast log2 function for bigint in JavaScript? I know that JS VM can do it in almost O(1) because it has information about the size of bigint. My current best algorithm is O(log(n)). Do you have any ideas for improvement?
github.com/functionalsc... #JavaScript #bigint #log2 #Algorithm
1
0
0
0