I have a set of ordered integers, e.g. {1,2,3,6,7,9,10} and I would like to partition the set in subsets of sequential numbers, e.g. {{1,2,3},{6,7},{9,10}}. Is there an easy way to do this?
7
$\begingroup$
$\endgroup$
9
$\begingroup$
$\endgroup$
Split[{1, 2, 3, 6, 7, 9, 10}, #2 - #1 == 1 &]
{{1, 2, 3}, {6, 7}, {9, 10}}
-
1$\begingroup$ How come you're using
Chophere? It works fine without it. $\endgroup$ – Carl Lange Oct 30 '18 at 22:55
7
$\begingroup$
$\endgroup$
Also
FindClusters[{1, 2, 3, 6, 7, 9, 10}]
answered Oct 31 '18 at 5:58
-
$\begingroup$ FindClusters is O(sqrt n), but split is O(n log n) $\endgroup$ – M.R. Oct 31 '18 at 17:14
-
$\begingroup$ @M.R. Really, thx for the information! I didn't know it. $\endgroup$ – Αλέξανδρος Ζεγγ Oct 31 '18 at 23:54
