How do I find a suitable index for a given X value in an array implemented min-binary-heap in o(log log n)? (no actual insertion is needed)
How do I find a suitable index for a given X value in an array implemented min-binary-heap in o(log log n)? (no actual insertion is needed)