If the numbers happen to be >=0, one could do a little better by merging in Huff... | Hacker News

Hacker News new | past | comments | ask | show | jobs | submit

login

srean on April 29, 2018 | parent | context | favorite | on: The quadratic formula and low-precision arithmetic

If the numbers happen to be >=0, one could do a little better by merging in Huffman order. In big 'O' the time complexity is the same.

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact