1D Number Array Clusterng
===

So let's say I have an array like this:
[1,1,2,3,10,11,13,67,71]
Is there a convenient way to partition the array into something like this?
[[1,1,2,3],[10,11,13],[67,71]]
I looked through similar questions yet most people suggested using kmeans to cluster points (like [scipy][1], which is quite confusing to use for a beginner like me), but I feel like that kmeans is more for two or more dimensional clustering right? Are there any ways to partition an array of N numbers to however many partitions depending on the numbers?
Some people also suggest rigid range partitioning, but it doesn't always render the results as
 expected

  [1]: http://docs.scipy.org/doc/scipy/reference/cluster.vq.html#