Version française
Home     About     Download     Resources     Contact us    

This site is updated infrequently. For up-to-date information, please visit the new OCaml website at

Browse thread
Data compression
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: 2007-07-08 (00:30)
From: Jon Harrop <jon@f...>
Subject: Data compression

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