CareerCup

Assuming no diagonal movement, and Length is accumulated on each step, recursively:
Length(i, j) = min( Length(i-1, j) + Value[i-1, j],
Length(i+1, j) + Value[i+1, j],
Length(i, j-1) + Value[i, j-1],
Length(i, j+1) + Value[i, j+1] );

To optimize, we can borrow from Dynamic programming and store calculated Length(i, j). So you look up at the beginning of the function and return, or store the calculated length at the end:

Length(i, j)
if (i, j) is border, return 0
if L[i, j] is stored, return L[i, j]
int length = min ( ... as above ... )
L[i,j] = length
return length

variation of flood fill algorithm

Is diagonal movement allowed ?

int ShortestPath(int **mat, int m, int n, int currposx, int currposy)
{
if(currposx < 0 || currposy < 0 || cussposx >= m || currposy >= n)
return;
if(currposx == m-1 || cussposy == n-1 || currposx == 0 || cussposy == 0)
return mat[currposz, currposy];
else
{
return min((shortestPath(mat, m, n, currposx+1, currposy),
(shortestPath(mat, m, n, currposx-1, currposy),
(shortestPath(mat, m, n, currposx, currposy+1),
(shortestPath(mat, m, n, currposx, currposy-1)) + mat[currposx,currposy];
}
}

Please let me know if I am doing something wrong here