Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
kerkeslager
on Aug 17, 2014
|
parent
|
context
|
favorite
| on:
Card Trick Leads to New Bound on Data Compression ...
Yeah, I mean, if you ignore domain constraints, the following is a great compression algorithm:
$infile = $ARGS[1] $outfile = $ARGS[2] touch $outfile
This was one of my favorite examples in Data Structures and Algorithms in college.
colanderman
on Aug 17, 2014
[–]
Except that's not lossless like I qualified.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search: