**commit** dc39ca31c4dd65bccaeafda743620b97ece5397b
**parent** 01e9a16dbd662d0bb5ff777601297452eae8a393
**Author:** Agastya Chandrakant <acagastya@outlook.com>
**Date:** Mon, 16 Apr 2018 22:06:50 +0530
clarify
**Diffstat:**

1 file changed, 2 insertions(+), 2 deletions(-)

**diff --git a/s4/fafl/report.md b/s4/fafl/report.md**
@@ -51,13 +51,13 @@ Since calculation of modulo is subtracion of `v` from `u` until `u` is strictly
1. While current cell value is not `0`, move right.
2. If current cell value is `0`, go left. If it is `1`: Go right. Go right. Else, goto step #3
- - If it is `1`:
+ - Having travelled two right from reading `1`, if current cell is `1`:
- Go right until current cell is `B`.
- Move left until current cell is `1`.
- Mark it as `X`.
- Move left until current cell is `B`.
- Move right, make `1` as `B`. Goto step #1.
- - If it is `X`, one subtraction is finished. (It's progress can be tracked, which will be mentioned later while dealing with quotient)
+ - Having travelled two right from reading `1`, if current cell is `X`, one subtraction is finished. (It's progress can be tracked, which will be mentioned later while dealing with quotient)
- Go right making all `X` as `1` until current cell is `B`.
- if current cell is `B` go left until current cell is `0`. Goto step #2.
3. If the current cell is `B`, go right, go right. If current cell is `X`, modulo is `0`. Stop. Else, goto step #4.