4 ms·

Can you explain your idea? Your algorithm is correct by definition, but doing this naively would be very slow (even for 32bit number). At this point it would be

• __s 2y ago
  For an example of binsearch algo, I recently dipped into this while switching some code from floats to fixed point arithmetic (reducing overall wasm blob size) https://github.com/serprex/openEtG/blob/2011007dec2616d1a24d3de6dd7cad93478711dd/src/rs/src/aieval.rs#L17 https://github.com/serprex/openEtG/blob/2011007dec2616d1a24d... Tho I could probably save binary size more by importing Math.sqrt from JS
  • smcameron 2y ago
    Recently, I had reason to dig around for a fixed point square root algorithm and found this: https://groups.google.com/g/comp.lang.c/c/IpwKbw0MAxw/m/N1xhe5n1rFoJ https://groups.google.com/g/comp.lang.c/c/IpwKbw0MAxw/m/N1xh...