I have a multidimentional array like this one with about 3000 rows and 200 columns:
+--+--+--+
|21|23|41|
+--+--+--+
|11|14|16| // 11 is the smalles value in 2nd row
+--+--+--+
|43|35|23|
+--+--+--+
I want to determine the smalles value of the second row. Is there a better / more readable / linq solution? I currently use a for-loop?
My current Approach:
int min = array[0,1];
for (int i= 1; i<len;i++)
{
if (array[i,1] < min)
{
min = array[i,1];
}
}