Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

> The Burrows–Wheeler transform (BWT) rearranges a character string into runs of similar characters, in a manner that can be reversed to recover the original string.

Seems pretty straightforward as a concept, but if you put a gun to my head I would never be able to implement it.

There are some ideas that are just beyond the capacity of some people, you may be able to hammer out an efficient compression program in an afternoon but be unable to transcribe a song you heard on the radio to paper. And the guy who can transcribe music will never understand how to create a systemd service.

Sometimes it's worth knowing that your audience will never be able to understand the problem and you need to work around that.

 help



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

Search: