* Data compression
@ 2007-07-08 0:25 Jon Harrop
2007-07-08 13:53 ` [Caml-list] " Olivier Andrieu
0 siblings, 1 reply; 2+ messages in thread
From: Jon Harrop @ 2007-07-08 0:25 UTC (permalink / raw)
To: caml-list
When I first learned the C programming language I found data compression
algorithms very educational. Does anyone have references to toy data
compression implementations written in OCaml?
There was a thread in the Haskell mailing list recently about a
Burrows-Wheeler implementation that is very concise and quite efficient in
Haskell. In particular, it uses the lazy sort to get the kth smallest element
in O(n) time trick... :-)
--
Dr Jon D Harrop, Flying Frog Consultancy Ltd.
The OCaml Journal
http://www.ffconsultancy.com/products/ocaml_journal/?e
^ permalink raw reply [flat|nested] 2+ messages in thread
end of thread, other threads:[~2007-07-08 13:53 UTC | newest]
Thread overview: 2+ messages (download: mbox.gz / follow: Atom feed)
-- links below jump to the message on this page --
2007-07-08 0:25 Data compression Jon Harrop
2007-07-08 13:53 ` [Caml-list] " Olivier Andrieu
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox;
as well as URLs for NNTP newsgroup(s).