Program to find the maximum number/factor in a list
You have two independent conditions that must be satisfied before updating cur_val.

The number must be divisible by factor
The number must be larger than cur_val

If the first test fails, you don't bother doing the second test.
How many instruction (or better cycles) does it take to do each test?
Given a long non-monotonic list, you may save considerable time simply by reversing these two tests.