4 ms·
Just do a proper Show HN post if you want to push your thing on HN
by zokier 4y ago
Just do a proper Show HN post if you want to push your thing on HN
- bugfix-66 4y agoThe site is not finished yet, but each algorithm is interesting on its own. Look at my submission history: https://news.ycombinator.com/submitted?id=bugfix-66 https://news.ycombinator.com/submitted?id=bugfix-66 Really remarkable tiny algorithms like Martin Rem's almost-forgotten Union-Find, the tiny bitwise linear string search from approximate-grep, hash treaps, Quicksearch (the fastest sublinear string search in practice), a simple state-of-the-art arithmetic coder/decoder, space-filling curves, the Shortest Path Faster algorithm, etc. Next week I'll publish a fantastic generalization of bytewise integer encoding (like Varint or git's VLQ but better). I'll do a Show HN for the site itself some time next year.
- ur-whale 4y agoNow do a real tiny, robust encryption algorithm.
- bugfix-66 4y agoThis was on the todo list: https://en.m.wikipedia.org/wiki/XXTEA https://en.m.wikipedia.org/wiki/XXTEA From one of the minds that brought you the Burrows-Wheeler transform. The problem is that the chosen plaintext attack is too cheap, so it's not interesting. But XXTEA is a historical curiosity like the Finnish predictor compressor, so maybe!
- imoreno 4y agoThis is a good suggestion. The title makes it sound like an article about some lesser-known but interesting compression algorithm. Turns out it's a Go puzzle bank. Nothing wrong with that, but it would be less confusing to make that a bit more clear.