Help understanding this algorithm that's supposed to solve the critical section problem through mutual exclusion
Note that the while bodies are empty, i.e., if the condition is false, they just fall through to the next line.

Horrible, horrible code; extremely restrictive (taking turns!), and very inefficient (busy waiting), if you ask me.