Hi,
Are you want to work on the task? If yes we might to study basics of compression. Are you ready to start?
On 8/14/06, Lukas Šalkauskas <[EMAIL PROTECTED]> wrote:
Hi, here is a task: http://prize.hutter1.net/who want to help me to create an algo to solve task write me. We can create a little
Good point. I had assumed that the array is sorted. Although not
mentioned in the original email, seeing the 1,2,3...n progression led
me to assume so. If the array is not sorted, I would definately sort
first.
Perhaps there is a method where I can scan for missing numbers while
sorting, or lo
