Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with compression
Search options not deleted
user 22059
The name given to the process of encoding data such that it uses lesser number of bits as compared to the original representation.
2
votes
1
answer
656
views
Comparing run-length decoding algorithms
I'm working on Ocaml.org 99 problems, and I solved the run-length decode one.
Here is the solution given by the site:
let decode l =
let rec many acc n x =
if n = 0 then acc else m …
- 34.9k