[CST-2] Kolmogorov complexity - cost of sorting

[Tom Puverle]

> Assuming you have N numbers evenly distributed between 0 and 1, you have
> already sorted them:
> 
> for i = 0 to 1 step (1/N)
> 	print i;
> 
> :-)

I meant to say "a set of numbers between 0 and 1 drawn from a uniform 
distribution". Sorry.