In article <3C**********************************@microsoft.co m>

"ErikNodland" <er**@gotaabejoking.comwrote:

Just after some ideas and suggestions on how to do this. I have a

large amount of numeric data which I would like to group given a

distance as a parameter.

IE. If my dataset was simply 1, 5, 9,10,11,16,17,25,29 and I pass in

a distance of 2 then I would want to end up with groups like

1, 5, (9,10,11), (16,17) ,25,29

How should the algorithm group the data if you have a string of

numbers within 2 of an adjacent number, but where the entire range of

such adjacent numbers is greater than 2?

For example:

5, 7, 9, 10, 11

[...]

any body have any good ideas to start me off

It seems to me that as long as you can come up with a reliable,

unambiguous rule about how the grouping should work, it will be easy.

Otherwise, it will be impossible. :)

Pete

--

I'm trying a new usenet client for Mac, Nemo OS X.

You can download it at

http://www.malcom-mac.com/nemo