Nrthugu

m = [[1,2,3],

    [2,1,3],

    [5,4,3]]

for i in range(len(m)):

    for j in range(len(m)*len(m)):

        if i <= len(m) and j <= (len(m)*len(m)):

            m[i][j] <= m[i+1][j+1]

            is_sink = "True"

        if i <= (len(m)-1) and j <= (len(m)*len(m)):

            m[i][j] <= m[i+1][j]

            is_sink = "True"

        if i <= len(m) and j <= ((len(m)*len(m))-1):

            m[i][j] <= m[i][j+1]

            is_sink = "True"

        if i <= (len(m)-1) and j <= (len(m)*len(m)):

            m[i][j] <= m[i+1][j-1]

            is_sink = "True"

        if i <= len(m) and j <= (len(m)*len(m)):

            m[i][j] <= m[i-1][j+1]

            is_sink = "True"

        if i <= len(m) and j <= (len(m)*len(m)):

            m[i][j] <= m[i][j-1]

            is_sink = "True"

        if i <= len(m) and j <= (len(m)*len(m)):

            m[i][j] <= m[i-1][j]

            is_sink = "True"

        else:

            is_sink = "False"

I was trying to compare adjacent cells to show the lowest point on a map. Although, it showing out of range, I am not very sure how to express the range properly. I am sure this code can be reduced but this is the best length I can display at the moment.

If you want to solve the problem of minimum value in a matrix by yourself (without any other imports), you can easily do it using the following:

import random

m = [[1,2,3],[2,1,3],[5,4,3]];

min_value = m[0][0]

for i in range(len(m)):

    for j in range(len(m)):

        if m[i][j] < min_value:

            min_value = m[i][j]

x = random.randint(0, len(m))

y = random.randint(0, len(m))

if m[x][y] == min_value:

    is_min = true;

else is_min = false;

print(is_min)

Because you have a square matrix, the length of columns is the same as the length of rows (meaning i and j are both in range of len(m))

To choose a random matrix component, you can compute 2 random numbers representing the row and column in the matrix. Then acces that component and compare it with the lowest point in the matrix calculated earlier.

If you are not necessarily interested in solving the problem yourself, here is an example using numpy which does that:

import numpy as np

m = np.array([[1,2,3],

              [2,1,3],

              [5,4,3]]) 

np.where(m == m.min())

For the issue in your code: j should go until len(m) as well (like i). For checking if the indices are out of the matrix, do not forget that python indexing goes from 0 to n-1 in case you have a list of length n.