Using the De Morgan Demogan law to understand the code

Demogan Law

Non (p and q) = (not P) or (not Q)
Non (p or q) = (not P) and (non-Q)

! (x && y) →!x | | !y! (x | | y) →!x &&!y

For example, find the three-digit minimum algorithm

if (x < y && x < z) min = x;else if (y < z) min = y;else min = z;

We are now using the law of De Morgan to see
The first if, the x < y && x < Z, if True then the minimum value is x, which is very well understood, the key is the following execution to else if (Y < Z) What is the condition? Nature is! (x < y && x < z) =x>=y | | x >=z, so if you run to this step, it means that x must be larger than the number of the two y,z, so it must not be the minimum, exclude, and then just determine the size of Y and Z is OK.

Using the De Morgan Demogan law to understand the code