Saddle Point in C Language
# Include <stdio. h>
Void main ()
{
Int a [3] [3] = {16, 2, 3}, {, 6}, {, 9 }};
Int I, j, k, x, y, z, n, max;
X = 0;
Y = 0;
Z = 0;
N = 0;
Max = a [0] [0];
For (I = 0; I <= 2; I ++)
{
For (j = 0; j <= 2; j ++)
If (max <a [I] [j])
{
Max = a [I] [j];
X = I;
Z = j;
}
For (k = 0; k <= 2; k ++)
If (max> a [k] [z])
{
Max = a [k] [z];
Y = k;
}
If (x = y)
N = 1;
}
If (n = 1)
Printf, z );
Else
Printf ("Œ fi ∞ µ„ £° \ n ");
}
What is the Saddle Point?
You know, riding on the horse and moving forward and forth will not fall down, so the direction along the horse Ridge is stable (the lowest point on the horse Ridge, equivalent to the minimum value ), however, the deviation between the left and right is easy to fall down, so the left and right are not stable. The lowest point on the horse is the Saddle Point.
In a differential equation, the data is stable along one direction, and the other is an unstable singularity, called a saddle point.
In a function, it is neither the maximum nor the critical point of the minimum value, nor the Saddle Point.
What is the Saddle Point?
You know, riding on the horse and moving forward and forth will not fall down, so the direction along the horse Ridge is stable (the lowest point on the horse Ridge, equivalent to the minimum value ), however, the deviation between the left and right is easy to fall down, so the left and right are not stable. The lowest point on the horse is the Saddle Point.
In a differential equation, the data is stable along one direction, and the other is an unstable singularity, called a saddle point.
In a function, it is neither the maximum nor the critical point of the minimum value, nor the Saddle Point.