Sergey Shandar#JavaScript is a weird language; it has #bigint, but it doesn't have a function that returns a number of bits in the bigint. Neither it has #log2 function for the bigints. If you need a workaround for the problem, see the article https://medium.com/@sergeyshandar/improving-the-log2-algorithm-for-bigint-in-javascript-7e5692e7bf0b?sk=9ac18367f61b524704cc8d82707aed3d
Does anyone know 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)). The algorithm performs faster than x.toString(2).length and consumes less memory. Do you have any ideas for improvement?
