Write a python program that determines the location of a saddle point of matrix if one exists. An m x n matrix is said to have a saddle point if some entry a[i][j] is the smallest value in row i and the largest value in j.
IDE: Visual Studio Code ( VSC ). Present: go2collage.Download hole Program / Project code, by clicking following link:
Programming Code:
def SaddlePoint(arr, n):
col = flag = 0
for i in range(0, n):
minVal = arr[i][0]
for j in range(0, n):
if (minVal > arr[i][j]):
minVal = arr[i][j]
col = j
maxVal = arr[i][col]
for i in range(0, n):
for j in range(0, n):
if maxVal < arr[i][col]:
maxVal = arr [i][col]
if (minVal == maxVal):
print("Saddle point Fund: ")
flag = 1
print("Number is : %d" % maxVal)
if flag == 0:
print("No Saddle point Found in Array.")
# Driver code
print("********** Saddle Point Demo **********")
n = int(input("Enter the order of the matrix: "))
arr = [[0 for col in range(n)] for row in range(n)]
for row in range(0, n):
for col in range(0, n):
item = int(input("Enter the element: "))
arr[row][col] = item
print("\nYou have entered following matrix: ")
for row in range(0, n):
for col in range(0, n):
print(arr[row][col], end=" ")
print()
SaddlePoint(arr, n)
Output:
0 Comments