Hi, I'm new to Algorithm And Analysis, I just started and found some problem, that is Brute Force,

In the Example,

GCD(m,n)

Brute Force - Consecutive Integer Checking

Step 1 - Assign the value of min {m,n} to t

Step 2 - Divide m by t. If the remainder of this division is 0, go Step 3, otherwise Step 4

Step 3 - Divide n by t. If the remainder of this division is 0, return the value of t as the answer and stop. Otherwise go Step 4

Step 4 - Decrease the value of t by 1. Go to Step 2

My Question is: I completely don't understand this clearly, Can someone help explain to me? Thanks for the help...