Hi all,

I'm not sure which is the most efficient way and 'fastest' that would deal with these issues.
Say you have:

M= a matrix of 5x3 =[x, y, z];

I want to have 3 rows at a time, so there will be 10 combinations..
the easiest way would be to have 10+ lines each with 
A=[x(1), y(1), z(1); x(2), y(2), z(2); x(3), y(3), z(3)];
B=[x(1), y(1), z(1); x(2), y(2), z(2); x(4), y(4), z(4)];
and so on.. but this is inconvenient..

---------------------------------------------------------
 
Problem 2:

say X=[1   2   2.5   7    30]
    Y=[20  30  2     15   27] 

A) is there a way of getting the closest three values in each array
   e.g. in X it would be 2, 2.5 and 1 (highest correlation)
B) say x,y is one location, x2,y2 is another.. how would I find the
   closest three points of these loacations?

sorry if this is too long, but any help would be appreciated
Thank you in advance..